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 "safe linear thompson sampling with side information"):
  Abstract: The design and performance analysis of bandit algorithms in the presence of stage-wise safety or reliability constraints has recently garnered significant interest. In this work, we consider the linear stochastic bandit problem under additional \textit{linear safety constraints} that need to be satisfied at each round. We provide a new safe algorithm based on linear Thompson Sampling (TS) for this problem and show a frequentist regret of order $\mathcal{O} (d^{3/2}\log^{1/2}d \cdot T^{1/2}\log^{3/2}T)$, which remarkably matches the results provided by (Abeille et al., 2017) for the standard linear TS algorithm in the absence of safety constraints. We compare the performance of our algorithm with UCB-based safe algorithms and highlight how the inherently randomized nature of TS leads to a superior performance in expanding the set of safe actions the algorithm has access to at each round.

Includes members:
  Member "linear stochastic bandits under safety constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "safe linear thompson sampling")
  Member "stagewise safe bayesian optimization with gaussian processes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust regression for safe exploration in control")
  Member "learning based model predictive control for safe exploration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploration exploitation in constrained mdps")
  Member "an information theoretic analysis of thompson sampling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "learning to optimize via posterior sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "analysis of thompson sampling for the multi armed bandit problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "a contextual bandit approach to personalized news article recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)