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: "Fast Probabilistic Modeling for Combinatorial Optimization"
  Abstract: Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture inter-parameter dependencies can have prohibitive computational costs. The algorithm presented in this paper, termed COMIT, provides a method for using probabilistic models in conjunction with fast search techniques. We show how COMIT can be used with two very different fast search algorithms: hillclimbing and Population-based incremental learning (PBIL). The resulting algorithms maintain many of the benefits of probabilistic modeling, with far less computational expense. Extensive empirical results are provided; COMIT has been successfully applied to jobshop scheduling, traveling salesman, and knapsack problems. This paper also presents a review of probabilistic modeling for combi natorial optimization.

Connected through hyperedge HE-1 (induced by source paper "MIMIC: Finding Optima by Estimating Probability Densities"):
  with members:
    - "Where Genetic Algorithms Excel"
    - "Reinforcement Learning by Probability Matching"

Connected through hyperedge HE-2 (induced by source paper "Book Review  Introduction to the Theory of Neural Computation Reviewed by: 2"):
  with members:
    - "Representing and Learning Visual Schemas in Neural Networks for Scene Analysis"
    - "Convergence-Zone Episodic Memory: Analysis and Simulations"
    - "Topography And Ocular Dominance: A Model Exploring Positive Correlations"
    - "Mean Field Theory for Sigmoid Belief Networks"
    - "Dyslexic and Category-Specific Aphasic Impairments in a Self-Organizing Feature Map Model of the Lexicon"
    - "Neural Networks and Statistical Models Proceedings of the Nineteenth Annual SAS Users Group International Conference,"
    - "Boltzmann Machine learning using mean field theory and linear response correction"
    - "Induction of Multiscale Temporal Structure"

Connected through hyperedge HE-3 (induced by source paper "Hill Climbing with Learning (An Abstraction of Genetic Algorithm)"):
  with members:
    - "Book Review  Introduction to the Theory of Neural Computation Reviewed by: 2"
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."

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: Genetic_Algorithms