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: "The Efficient Learning of Multiple Task Sequences"
  Abstract: I present a modular network architecture and a learning algorithm based on incremental dynamic programming that allows a single learning agent to learn to solve multiple Markovian decision tasks (MDTs) with significant transfer of learning across the tasks. I consider a class of MDTs, called composite tasks, formed by temporally concatenating a number of simpler, elemental MDTs. The architecture is trained on a set of composite and elemental MDTs. The temporal structure of a composite task is assumed to be unknown and the architecture learns to produce a temporal decomposition. It is shown that under certain conditions the solution of a composite MDT can be constructed by computationally inexpensive modifications of the solutions of its constituent elemental MDTs.

Connected through hyperedge HE-1 (induced by source paper "Transfer of Learning by Composing Solutions of Elemental Sequential Tasks"):
  with members:
    - "A Modular Q-Learning Architecture for Manipulator Task Decomposition `Data storage in the cerebellar model ar"
    - "A Coevolutionary Approach to Learning Sequential Decision Rules"
    - "Hierarchical Explanation-Based Reinforcement Learning"
    - "Robust Reinforcement Learning in Motion Planning"
    - "Learning to Achieve Goals"
    - "Using Case-Based Reasoning as a Reinforcement Learning Framework for Optimization with Changing Criteria"
    - "Emergent Hierarchical Control Structures: Learning Reactive/Hierarchical Relationships in Reinforcement Environments"
    - "Learning Hierarchical Control Structures for Multiple Tasks and Changing Environments"

Connected through hyperedge HE-2 (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"
    - "Exploration and Model Building in Mobile Robot Domains"
    - "A Unified Analysis of Value-Function-Based Reinforcement-Learning Algorithms"

Connected through hyperedge HE-3 (induced by source paper "A Modular Q-Learning Architecture for Manipulator Task Decomposition `Data storage in the cerebellar model ar"):
  with members:
    - "Hierarchical Mixtures of Experts and the EM Algorithm"
    - "References elements that can solve difficult learning control problems. on Simulation of Adaptive Behavior, pages"
    - "Transfer of Learning by Composing Solutions of Elemental Sequential Tasks"
    - "Exploration and Model Building in Mobile Robot Domains"

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 "Exploration and Model Building in Mobile Robot Domains"):
  with members:
    - "Learning to Act using Real-Time Dynamic Programming"
    - "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"
    - "Lazy Acquisition of Place Knowledge"
    - "LEARNING BY ERROR-DRIVEN DECOMPOSITION"
    - "The Influence of Domain Properties on the Performance of Real-Time Search Algorithms"
    - "Case-Based Acquisition of Place Knowledge"

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