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: "A NEW SEQUENTIAL SIMULATED ANNEALING METHOD"
  Abstract: Let H be a function not explicitly defined, but approximable by a sequence (H n ) n0 of functional estimators. In this context we propose a new sequential algorithm to optimise asymptotically H using stepwise estimators H n . We prove under mild conditions the almost sure convergence in law of this algorithm.

Connected through hyperedge HE-1 (induced by source paper "A SEQUENTIAL METROPOLIS-HASTINGS ALGORITHM"):
  with members:
    (none)

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