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: "Active Gesture Recognition using Partially Observable Markov Decision Processes"
  Abstract: M.I.T Media Laboratory Perceptual Computing Section Technical Report No. 367 Appeared 13th IEEE Intl. Conference on Pattern Recognition (ICPR '96), Vienna, Austria. Abstract We present a foveated gesture recognition system that guides an active camera to foveate salient features based on a reinforcement learning paradigm. Using vision routines previously implemented for an interactive environment, we determine the spatial location of salient body parts of a user and guide an active camera to obtain images of gestures or expressions. A hidden-state reinforcement learning paradigm based on the Partially Observable Markov Decision Process (POMDP) is used to implement this visual attention. The attention module selects targets to foveate based on the goal of successful recognition, and uses a new multiple-model Q-learning formulation. Given a set of target and distractor gestures, our system can learn where to foveate to maximally discriminate a particular gesture.

Connected through hyperedge HE-1 (induced by source paper "Planning and Acting in Partially Observable Stochastic Domains"):
  with members:
    - "Optimal Navigation in a Probibalistic World"
    - "A Cognitive Model of Learning to Navigate"

Connected through hyperedge HE-2 (induced by source paper "Learning networks for face analysis and synthesis"):
  with members:
    - "A Delay Damage Model Selection Algorithm for NARX Neural Networks"
    - "Equivalence of Linear Boltzmann Chains and Hidden Markov Models sequence L, is: where Z(; A;"
    - "Learning from incomplete data"
    - "PRIOR KNOWLEDGE AND THE CREATION OF "VIRTUAL" EXAMPLES FOR RBF NETWORKS 1"
    - "Regularization Theory and Neural Networks Architectures"
    - "In Advances in Neural Information Processing Systems 8  Gaussian Processes for Regression"
    - "Efficient Implementation of Gaussian Processes"
    - "for Projective Basis Function Networks 2m1 Global Form 2m Local Form With appropriate constant factors,"

Connected through hyperedge HE-3 (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"
    - "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"
    - "A Unified Analysis of Value-Function-Based Reinforcement-Learning Algorithms"

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"
    - "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"
    - "Approximating Optimal Policies for Partially Observable Stochastic Domains"

Connected through hyperedge HE-5 (induced by source paper "Reinforcement Learning Algorithm for Partially Observable Markov Decision Problems"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "Approximating Optimal Policies for Partially Observable Stochastic Domains"
    - "On the Convergence of Stochastic Iterative Dynamic Programming Algorithms"
    - "Learning Without State-Estimation in Partially Observable Markovian Decision Processes"

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