human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups papers that share a common citing paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "Machine Learning,  Explanation-Based Learning and Reinforcement Learning: A Unified View"):
  Abstract: In speedup-learning problems, where full descriptions of operators are known, both explanation-based learning (EBL) and reinforcement learning (RL) methods can be applied. This paper shows that both methods involve fundamentally the same process of propagating information backward from the goal toward the starting state. Most RL methods perform this propagation on a state-by-state basis, while EBL methods compute the weakest preconditions of operators, and hence, perform this propagation on a region-by-region basis. Barto, Bradtke, and Singh (1995) have observed that many algorithms for reinforcement learning can be viewed as asynchronous dynamic programming. Based on this observation, this paper shows how to develop dynamic programming versions of EBL, which we call region-based dynamic programming or Explanation-Based Reinforcement Learning (EBRL). The paper compares batch and online versions of EBRL to batch and online versions of point-based dynamic programming and to standard EBL. The results show that region-based dynamic programming combines the strengths of EBL (fast learning and the ability to scale to large state spaces) with the strengths of reinforcement learning algorithms (learning of optimal policies). Results are shown in chess endgames and in synthetic maze tasks.

Includes members:
  Member "Learning to Act using Real-Time Dynamic Programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "On the Complexity of Solving Markov Decision Problems")
  Member "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "TDLeaf(): Combining Temporal Difference learning with game-tree search.")
  Member "The Parti-game Algorithm for Variable Resolution Reinforcement Learning in Multidimensional State-spaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "On the Complexity of Solving Markov Decision Problems")
  Member "Hierarchical Explanation-Based Reinforcement Learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "Transfer of Learning by Composing Solutions of Elemental Sequential Tasks")

Question: Please tell me which class the citing paper (i.e., the source paper of the center hyperedge) 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