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 "delay adaptive learning in generalized linear contextual bandits"):
  Abstract: In this paper, we consider online learning in generalized linear contextual bandits where rewards are not immediately observed. Instead, rewards are available to the decision-maker only after some delay, which is unknown and stochastic. We study the performance of two well-known algorithms adapted to this delayed setting: one based on upper confidence bounds, and the other based on Thompson sampling. We describe modifications on how these two algorithms should be adapted to handle delays and give regret characterizations for both algorithms. Our results contribute to the broad landscape of contextual bandits literature by establishing that both algorithms can be made to be robust to delays, thereby helping clarify and reaffirm the empirical success of these two algorithms, which are widely deployed in modern recommendation engines.

Includes members:
  Member "provably optimal algorithms for generalized linear contextual bandits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "thompson sampling for the mnl bandit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "combinatorial bandits with relative feedback")
  Member "delay and cooperation in nonstochastic bandits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the gossiping insert eliminate algorithm for multi agent bandits")
  Member "asymptotic convergence in online learning with unbounded delays":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonstochastic multiarmed bandits with unrestricted delays")
  Member "off policy evaluation for slate recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "safe counterfactual reinforcement learning")
  Member "an efficient algorithm for contextual bandits with knapsacks and an extension to concave objectives":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "advances in bandits with knapsacks")
  Member "taming the monster a fast and simple algorithm for contextual bandits":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "an information theoretic analysis of thompson sampling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "effective diversity in population based reinforcement learning")

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)