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: "Learning from undiscounted delayed rewards"
  Abstract: The general framework of reinforcement learning has been proposed by several researchers for both the solution of optimization problems and the realization of adaptive control schemes. To allow for an efficient application of reinforcement learning in either of these areas, it is necessary to solve both the structural and the temporal credit assignment problem. In this paper, we concentrate on the latter which is usually tackled through the use of learning algorithms that employ discounted rewards. We argue that for realistic problems this kind of solution is not satisfactory, since it does not address the effect of noise originating from different experiences and does not allow for an easy explanation of the parameters involved in the learning process. As a possible solution, we propose to keep the delayed reward undiscounted, but to discount the actual adaptation rate. Empirical results show that dependent on the kind of discount used amore stable convergence and even an increase in performance can be obtained.

Connected through hyperedge HE-1 (induced by source paper "Designing Neural Networks for Adaptive Control"):
  with members:
    - "References elements that can solve difficult learning control problems. on Simulation of Adaptive Behavior, pages"
    - "Learning Controllers for Industrial Robots"

Connected through hyperedge HE-2 (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-3 (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