human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "further optimal regret bounds for thompson sampling"
  Abstract: Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant interest after several studies demonstrated it to have better empirical performance compared to the state of the art methods. In this paper, we provide a novel regret analysis for Thompson Sampling that simultaneously proves both the optimal problem-dependent bound of $(1+\epsilon)\sum_i \frac{\ln T}{\Delta_i}+O(\frac{N}{\epsilon^2})$ and the first near-optimal problem-independent bound of $O(\sqrt{NT\ln T})$ on the expected regret of this algorithm. Our near-optimal problem-independent bound solves a COLT 2012 open problem of Chapelle and Li. The optimal problem-dependent regret bound for this problem was first proven recently by Kaufmann et al. [ALT 2012]. Our novel martingale-based analysis techniques are conceptually simple, easily extend to distributions other than the Beta distribution, and also extend to the more general contextual bandits setting [Manuscript, Agrawal and Goyal, 2012].

Connected through hyperedge HE-1 (induced by source paper "delay adaptive learning in generalized linear contextual bandits"):
  with members:
    - "provably optimal algorithms for generalized linear contextual bandits"
    - "thompson sampling for the mnl bandit"
    - "delay and cooperation in nonstochastic bandits"
    - "asymptotic convergence in online learning with unbounded delays"
    - "off policy evaluation for slate recommendation"
    - "an efficient algorithm for contextual bandits with knapsacks and an extension to concave objectives"
    - "taming the monster a fast and simple algorithm for contextual bandits"
    - "an information theoretic analysis of thompson sampling"

Connected through hyperedge HE-2 (induced by source paper "sample complexity of incentivized exploration"):
  with members:
    - "introduction to multi armed bandits"
    - "overabundant information and learning traps"
    - "optimal and myopic information acquisition"
    - "descending price optimally coordinates search"
    - "bayesian incentive compatible bandit exploration"
    - "economic recommendation systems"
    - "adaptive contract design for crowdsourcing markets bandit algorithms for repeated principal agent problems"
    - "bandits with knapsacks"

Connected through hyperedge HE-3 (induced by source paper "feedback graph regret bounds for thompson sampling and ucb"):
  with members:
    - "information directed sampling for stochastic bandits with graph feedback"
    - "thompson sampling for stochastic bandits with graph feedback"
    - "small loss bounds for online learning with partial information"
    - "reward maximization under uncertainty leveraging side observations on networks"
    - "online learning with feedback graphs without the graphs"
    - "online learning with feedback graphs beyond bandits"
    - "nonstochastic multi armed bandits with graph structured feedback"
    - "learning to optimize via information directed sampling"

Connected through hyperedge HE-4 (induced by source paper "stochastic linear contextual bandits with diverse contexts"):
  with members:
    - "budget constrained edge service provisioning with demand estimation via bandit learning"
    - "a smoothed analysis of the greedy algorithm for the linear contextual bandit problem"
    - "taming the monster a fast and simple algorithm for contextual bandits"
    - "finite time analysis of kernelised contextual bandits"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "efficient optimal learning for contextual bandits"
    - "analysis of thompson sampling for the multi armed bandit problem"
    - "a contextual bandit approach to personalized news article recommendation"

Connected through hyperedge HE-5 (induced by source paper "better boosting with bandits for online learning"):
  with members:
    - "online isotonic regression"
    - "thompson sampling in switching environments with bayesian online change point detection"
    - "obtaining calibrated probabilities from boosting"
    - "unbiased offline evaluation of contextual bandit based news article recommendation algorithms"
    - "analysis of thompson sampling for the multi armed bandit problem"
    - "multi armed bandits in metric spaces"

Connected through hyperedge HE-6 (induced by source paper "multi agent thompson sampling for bandit applications with sparse neighbourhood structures"):
  with members:
    - "fleetwide data enabled reliability improvement of wind turbines"
    - "bayesian best arm identification for selecting influenza mitigation strategies"
    - "learning to optimize via posterior sampling"
    - "policy iteration for factored mdps"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"

Connected through hyperedge HE-7 (induced by source paper "on thompson sampling with langevin algorithms"):
  with members:
    - "thompson sampling and approximate inference"
    - "an information theoretic analysis of thompson sampling"
    - "analysis of thompson sampling for the multi armed bandit problem"

Connected through hyperedge HE-8 (induced by source paper "meta reinforcement learning as task inference"):
  with members:
    - "guided meta policy search"
    - "efficient off policy meta reinforcement learning via probabilistic context variables"
    - "emergent coordination through competition"
    - "deepmind control suite"
    - "neural processes"
    - "recasting gradient based meta learning as hierarchical bayes"
    - "neural predictive belief representations"
    - "learning dexterous in hand manipulation"

Question: Please tell me which class the center node 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)