human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a practical method for solving contextual bandit problems using decision trees"):
  Abstract: Many efficient algorithms with strong theoretical guarantees have been proposed for the contextual multi-armed bandit problem. However, applying these algorithms in practice can be difficult because they require domain expertise to build appropriate features and to tune their parameters. We propose a new method for the contextual bandit problem that is simple, practical, and can be applied with little or no domain expertise. Our algorithm relies on decision trees to model the context-reward relationship. Decision trees are non-parametric, interpretable, and work well without hand-crafted features. To guide the exploration-exploitation trade-off, we use a bootstrapping approach which abstracts Thompson sampling to non-Bayesian settings. We also discuss several computational heuristics and demonstrate the performance of our method on several datasets.

Includes members:
  Member "taming the monster a fast and simple algorithm for contextual bandits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "a neural networks committee for the contextual bandit problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "thompson sampling with the online bootstrap":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "budgeted policy learning for task oriented dialogue systems")
  Member "learning to optimize via posterior sampling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "thompson sampling for contextual bandits with linear payoffs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "efficient optimal learning for contextual bandits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "a contextual bandit approach to personalized news article recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LG(Machine Learning)