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: "Large Margin Classification Using the Perceptron Algorithm"
  Abstract: We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like Vapnik's maximal-margin classifier, our algorithm takes advantage of data that are linearly separable with large margins. Compared to Vapnik's algorithm, however, ours is much simpler to implement, and much more efficient in terms of computation time. We also show that our algorithm can be efficiently used in very high dimensional spaces using kernel functions. We performed some experiments using our algorithm, and some variants of it, for classifying images of handwritten digits. The performance of our algorithm is close to, but not as good as, the performance of maximal-margin classifiers on the same problem.

Connected through hyperedge HE-1 (induced by source paper "How to Use Expert Advice (Extended Abstract)"):
  with members:
    - "Online Learning versus O*ine Learning"
    - "Simulating Access to Hidden Information while Learning"
    - "Toward Efficient Agnostic Learning"
    - "Efficient Distribution-free Learning of Probabilistic Concepts"
    - "Context-sensitive learning methods for text categorization"
    - "WORST CASE PREDICTION OVER SEQUENCES UNDER LOG LOSS"
    - "An Efficient Extension to Mixture Techniques for Prediction and Decision Trees"
    - "The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs"

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