human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "Figure 3: Average model size accepted from a ran-dom prefix-closed samples of various size, and"
  Abstract: that is based on Angluin's L fl algorithm. The algorithm maintains a model consistent with its past examples. When a new counterexample arrives it tries to extend the model in a minimal fashion. We conducted a set of experiments where random automata that represent different strategies were generated, and the algorithm tried to learn them based on prefix-closed samples of their behavior. The algorithm managed to learn very compact models that agree with the samples. The size of the sample had a small effect on the size of the model. The experimental results suggest that for random prefix-closed samples the algorithm behaves well. However, following Angluin's result on the difficulty of learning almost uniform complete samples [ An-gluin, 1978 ] , it is obvious that our algorithm does not solve the complexity issue of inferring a DFA from a general prefix-closed sample. We are currently looking for classes of prefix-closed samples in which US-L* behaves well. [ Carmel and Markovitch, 1994 ] D. Carmel and S. Markovitch. The M* algorithm: Incorporating opponent models into adversary search. Technical Report CIS report 9402, Technion, March 1994. [ Carmel and Markovitch, 1995 ] D. Carmel and S. Markovitch. Unsupervised learning of finite automata: A practical approach. Technical Report CIS report 9504, Technion, March 1995. [ Shoham and Tennenholtz, 1994 ] Y. Shoham and M. Tennenholtz. Co-Learning and the evolution of social activity. Technical Report STAN-CS-TR-94-1511, Stanford Univrsity, Department of Computer Science, 1994.

Connected through hyperedge HE-1 (induced by source paper "Learning to coordinate without sharing information"):
  with members:
    - "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"
    - "Multi-Agent Reinforcement Learning: Independent vs. Cooperative Agents"
    - "Reinforcement Learning with Imitation in Heterogeneous Multi-Agent Systems"
    - "Adaptive Load Balancing: A Study in Multi-Agent Learning"

Connected through hyperedge HE-2 (induced by source paper "Markov games as a framework for multi-agent reinforcement learning"):
  with members:
    - "Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms"
    - "A Competitive Approach to Game Learning"
    - "Learning Team Strategies With Multiple Policy-Sharing Agents: A Soccer Case Study"
    - "database"
    - "Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm"
    - "Multi-Agent Reinforcement Learning: Independent vs. Cooperative Agents"
    - "Learning Conventions in Multiagent Stochastic Domains using Likelihood Estimates"
    - "Reinforcement Learning with Imitation in Heterogeneous Multi-Agent Systems"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Theory