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: "an algorithm with nearly optimal pseudo regret for both stochastic and adversarial bandits"
  Abstract: We present an algorithm that achieves almost optimal pseudo-regret bounds against adversarial and stochastic bandits. Against adversarial bandits the pseudo-regret is $O(K\sqrt{n \log n})$ and against stochastic bandits the pseudo-regret is $O(\sum_i (\log n)/\Delta_i)$. We also show that no algorithm with $O(\log n)$ pseudo-regret against stochastic bandits can achieve $\tilde{O}(\sqrt{n})$ expected regret against adaptive adversarial bandits. This complements previous results of Bubeck and Slivkins (2012) that show $\tilde{O}(\sqrt{n})$ expected adversarial regret with $O((\log n)^2)$ stochastic pseudo-regret.

Connected through hyperedge HE-1 (induced by source paper "bandits with adversarial scaling"):
  with members:
    - "beating stochastic and adversarial semi bandits optimally and simultaneously"
    - "improved path length regret bounds for bandits"
    - "competing bandits the perils of exploration under competition"
    - "factored bandits"
    - "stochastic bandits robust to adversarial corruptions"
    - "more adaptive algorithms for adversarial bandits"
    - "make the minority great again first order regret bound for contextual bandits"
    - "bandit regret scaling with the effective loss range"

Connected through hyperedge HE-2 (induced by source paper "robust stochastic bandit algorithms under probabilistic unbounded adversarial attack"):
  with members:
    - "data poisoning attacks on stochastic bandits"
    - "better algorithms for stochastic bandits with adversarial corruptions"
    - "stochastic bandits robust to adversarial corruptions"
    - "an improved parametrization and analysis of the exp3 algorithm for stochastic and adversarial bandits"
    - "algorithms for multi armed bandit problems"
    - "the best of both worlds stochastic and adversarial bandits"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "decentralized online learning algorithms for opportunistic spectrum access"

Connected through hyperedge HE-3 (induced by source paper "model selection in contextual stochastic bandit problems"):
  with members:
    - "model selection for contextual bandits"
    - "a smoothed analysis of the greedy algorithm for the linear contextual bandit problem"
    - "corralling a band of bandit algorithms"
    - "the best of both worlds stochastic and adversarial bandits"
    - "a contextual bandit approach to personalized news article recommendation"

Connected through hyperedge HE-4 (induced by source paper "grinding the space learning to classify against strategic agents"):
  with members:
    - "equal opportunity in online classification with partial feedback"
    - "distribution independent pac learning of halfspaces with massart noise"
    - "strategizing against no regret learners"
    - "introduction to multi armed bandits"
    - "nearly tight bounds for robust proper learning of halfspaces with a margin"
    - "competing prediction algorithms"
    - "strategyproof linear regression in high dimensions"
    - "strategic classification from revealed preferences"

Connected through hyperedge HE-5 (induced by source paper "corruption robust exploration in episodic reinforcement learning"):
  with members:
    - "stochastic linear optimization with adversarial corruption"
    - "provably efficient reinforcement learning with linear function approximation"
    - "tighter problem dependent regret bounds in reinforcement learning without domain knowledge using value function bounds"
    - "online convex optimization in adversarial markov decision processes"
    - "beating stochastic and adversarial semi bandits optimally and simultaneously"
    - "better algorithms for stochastic bandits with adversarial corruptions"
    - "non asymptotic gap dependent regret bounds for tabular mdps"
    - "recent advances in algorithmic high dimensional robust statistics"

Connected through hyperedge HE-6 (induced by source paper "better algorithms for stochastic bandits with adversarial corruptions"):
  with members:
    - "beating stochastic and adversarial semi bandits optimally and simultaneously"
    - "stochastic bandits robust to adversarial corruptions"
    - "efficient algorithms for outlier robust regression"
    - "tsallis inf an optimal algorithm for stochastic and adversarial bandits"
    - "almost optimal algorithms for linear stochastic bandits with heavy tailed payoffs"
    - "learning geometric concepts with nasty noise"
    - "an improved parametrization and analysis of the exp3 algorithm for stochastic and adversarial bandits"
    - "learning from untrusted data"

Connected through hyperedge HE-7 (induced by source paper "improved path length regret bounds for bandits"):
  with members:
    - "chasing convex bodies optimally"
    - "black box reductions for parameter free online learning in banach spaces"
    - "competitively chasing convex bodies"
    - "more adaptive algorithms for adversarial bandits"
    - "make the minority great again first order regret bound for contextual bandits"
    - "adaptive online learning in dynamic environments"
    - "tracking the best expert in non stationary stochastic environments"
    - "online optimization in dynamic environments improved regret rates for strongly convex problems"

Connected through hyperedge HE-8 (induced by source paper "adversarial bandits with knapsacks"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "introduction to online convex optimization"
    - "introduction to multi armed bandits"
    - "bandit convex optimization for scalable and dynamic iot management"
    - "acceleration through optimistic no regret dynamics"
    - "stochastic bandits robust to adversarial corruptions"
    - "more adaptive algorithms for adversarial bandits"
    - "unifying the stochastic and the adversarial bandits with knapsack"

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)