human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups papers that share a common citing paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "Using and combining predictors that specialize"):
  Abstract: We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called experts. These simple algorithms belong to the multiplicative weights family of algorithms. The performance of these algorithms degrades only logarithmically with the number of experts, making them particularly useful in applications where the number of experts is very large. However, in applications such as text categorization, it is often natural for some of the experts to abstain from making predictions on some of the instances. We show how to transform algorithms that assume that all experts are always awake to algorithms that do not require this assumption. We also show how to derive corresponding loss bounds. Our method is very general, and can be applied to a large family of online learning algorithms. We also give applications to various prediction models including decision graphs and switching experts.

Includes members:
  Member "How to Use Expert Advice (Extended Abstract)":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "Update rules for parameter estimation in Bayesian networks")
  Member "Learning Probabilistic Automata with Variable Memory Length":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "Machine Learning 27(1):51-68, 1997. Predicting nearly as well as the best pruning of a decision tree")
  Member "Context-sensitive learning methods for text categorization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "A decision-theoretic generalization of on-line learning and an application to boosting how the weight-update rule")
  Member "Machine Learning 27(1):51-68, 1997. Predicting nearly as well as the best pruning of a decision tree":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "On Pruning and Averaging Decision Trees")

Question: Please tell me which class the citing paper (i.e., the source paper of the center hyperedge) 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