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: "On the Computational Economics of Reinforcement Learning"
  Abstract: Following terminology used in adaptive control, we distinguish between indirect learning methods, which learn explicit models of the dynamic structure of the system to be controlled, and direct learning methods, which do not. We compare an existing indirect method, which uses a conventional dynamic programming algorithm, with a closely related direct reinforcement learning method by applying both methods to an infinite horizon Markov decision problem with unknown state-transition probabilities. The simulations show that although the direct method requires much less space and dramatically less computation per control action, its learning ability in this task is superior to, or compares favorably with, that of the more complex indirect method. Although these results do not address how the methods' performances compare as problems become more difficult, they suggest that given a fixed amount of computational power available per control action, it may be better to use a direct reinforcement learning method augmented with indirect techniques than to devote all available resources to a computation-ally costly indirect method. Comprehensive answers to the questions raised by this study depend on many factors making up the eco nomic context of the computation.

Connected through hyperedge HE-1 (induced by source paper "Learning to Act using Real-Time Dynamic Programming"):
  with members:
    - "Submitted to NIPS96, Section: Applications. Preference: Oral presentation Reinforcement Learning for Dynamic Channel Allocation in"
    - "Active Gesture Recognition using Partially Observable Markov Decision Processes"
    - "Scaling Up Average Reward Reinforcement Learning by Approximating the Domain Models and the Value Function"
    - "Learning sorting and decision trees with POMDPs"
    - "Markov Decision Processes in Large State Spaces"
    - "Learning Curve Bounds for Markov Decision Processes with Undiscounted Rewards"
    - "The Efficient Learning of Multiple Task Sequences"
    - "Exploration and Model Building in Mobile Robot Domains"

Connected through hyperedge HE-2 (induced by source paper "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "References elements that can solve difficult learning control problems. on Simulation of Adaptive Behavior, pages"
    - "Using a Case Base of Surfaces to Speed-Up Reinforcement Learning"
    - "Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms"
    - "Exploration and Model Building in Mobile Robot Domains"
    - "Strategy Learning with Multilayer Connectionist Representations 1"
    - "Least-Squares Temporal Difference Learning"
    - "An Upper Bound on the Loss from Approximate Optimal-Value Functions"

Connected through hyperedge HE-3 (induced by source paper "Strategy Learning with Multilayer Connectionist Representations 1"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "References elements that can solve difficult learning control problems. on Simulation of Adaptive Behavior, pages"
    - "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"
    - "Q-Learning with Hidden-Unit Restarting"
    - "Reinforcement Learning with Modular Neural Networks for Control"
    - "NEUROCONTROL BY REINFORCEMENT LEARNING"
    - "Learning to Race: Experiments with a Simulated Race Car"
    - "Coordinating Reactive Behaviors  keywords: reactive systems, planning and learning"

Connected through hyperedge HE-4 (induced by source paper "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"):
  with members:
    - "Submitted to NIPS96, Section: Applications. Preference: Oral presentation Reinforcement Learning for Dynamic Channel Allocation in"
    - "High-Performance Job-Shop Scheduling With A Time-Delay TD() Network"
    - "Active Gesture Recognition using Partially Observable Markov Decision Processes"
    - "References elements that can solve difficult learning control problems. on Simulation of Adaptive Behavior, pages"
    - "Generalization in Reinforcement Learning: Safely Approximating the Value Function"
    - "Using a Case Base of Surfaces to Speed-Up Reinforcement Learning"
    - "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"
    - "A Reinforcement Learning Approach to Job-shop Scheduling"

Connected through hyperedge HE-5 (induced by source paper "References elements that can solve difficult learning control problems. on Simulation of Adaptive Behavior, pages"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "Decision Tree Function Approximation in Reinforcement Learning"
    - "USING MARKER-BASED GENETIC ENCODING OF NEURAL NETWORKS TO EVOLVE FINITE-STATE BEHAVIOUR"
    - "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"
    - "A Modular Q-Learning Architecture for Manipulator Task Decomposition `Data storage in the cerebellar model ar"
    - "Living in a partially structured environment: How to bypass the limitations of classical reinforcement techniques"
    - "A Neural Network Pole Balancer that Learns and Operates on a Real Robot in Real Time"
    - "Q-Learning with Hidden-Unit Restarting"

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: Reinforcement_Learning