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: "MultiPlayer Residual Advantage Learning With General Function Approximation"
  Abstract: A new algorithm, advantage learning, is presented that improves on advantage updating by requiring that a single function be learned rather than two. Furthermore, advantage learning requires only a single type of update, the learning update, while advantage updating requires two different types of updates, a learning update and a normilization update. The reinforcement learning system uses the residual form of advantage learning. An application of reinforcement learning to a Markov game is presented. The testbed has continuous states and nonlinear dynamics. The game consists of two players, a missile and a plane; the missile pursues the plane and the plane evades the missile. On each time step , each player chooses one of two possible actions; turn left or turn right, resulting in a 90 degree instantaneous change in the aircraft s heading. Reinforcement is given only when the missile hits the plane or the plane reaches an escape distance from the missile. The advantage function is stored in a single-hidden-layer sigmoidal network. Speed of learning is increased by a new algorithm , Incremental Delta-Delta (IDD), which extends Jacobs (1988) Delta-Delta for use in incremental training, and differs from Suttons Incremental Delta-Bar-Delta (1992) in that it does not require the use of a trace and is amenable for use with general function approximation systems. The advantage learning algorithm for optimal control is modified for games in order to find the minimax point, rather than the maximum. Empirical results gathered using the missile/aircraft testbed validate theory that suggests residual forms of reinforcement learning algorithms converge to a local minimum of the mean squared Bellman residual when using general function approximation systems. Also, to our knowledge, this is the first time an approximate second order method has been used with residual algorithms. Empirical results are presented comparing convergence rates with and without the use of IDD for the reinforcement learning testbed described above and for a supervised learning testbed. The results of these experiments demonstrate IDD increased the rate of convergence and resulted in an order of magnitude lower total asymptotic error than when using backpropagation alone.

Connected through hyperedge HE-1 (induced by source paper "Spurious Solutions to the Bellman Equation"):
  with members:
    - "In  Improving Elevator Performance Using Reinforcement Learning"

Connected through hyperedge HE-2 (induced by source paper "Adapting Bias by Gradient Descent: An Incremental Version of Delta-Bar-Delta"):
  with members:
    - "Gain Adaptation Beats Least Squares?"

Connected through hyperedge HE-3 (induced by source paper "Metrics for Temporal Difference Learning"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"

Connected through hyperedge HE-4 (induced by source paper "Generalization in Reinforcement Learning: Safely Approximating the Value Function"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "Decision Tree Function Approximation in Reinforcement Learning"
    - "Scaling Up Average Reward Reinforcement Learning by Approximating the Domain Models and the Value Function"
    - "A Reinforcement Learning Approach to Job-shop Scheduling"
    - "Value Function Approximations and Job-Shop Scheduling"
    - "Robust Value Function Approximation by Working Backwards Computing an accurate value function is the key"
    - "An Upper Bound on the Loss from Approximate Optimal-Value Functions"
    - "Issues in Using Function Approximation for Reinforcement Learning"

Connected through hyperedge HE-5 (induced by source paper "Residual Q-Learning Applied to Visual Attention"):
  with members:
    (none)

Connected through hyperedge HE-6 (induced by source paper "Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms"):
  with members:
    - "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"
    - "Acting under Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation"
    - "Markov games as a framework for multi-agent reinforcement learning"
    - "Markov Decision Processes in Large State Spaces"
    - "A Unified Analysis of Value-Function-Based Reinforcement-Learning Algorithms"
    - "Asynchronous Modified Policy Iteration with Single-sided Updates"
    - "Auto-exploratory Average Reward Reinforcement Learning"
    - "On the Complexity of Solving Markov Decision Problems"

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

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