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 "importance weighting without importance weights an efficient algorithm for combinatorial semi bandits"):
  Abstract: We propose a sample-efficient alternative for importance weighting for situations where one only has sample access to the probability distribution that generates the observations. Our new method, called Geometric Resampling (GR), is described and analyzed in the context of online combinatorial optimization under semi-bandit feedback, where a learner sequentially selects its actions from a combinatorial decision set so as to minimize its cumulative loss. In particular, we show that the well-known Follow-the-Perturbed-Leader (FPL) prediction method coupled with Geometric Resampling yields the first computationally efficient reduction from offline to online optimization in this setting. We provide a thorough theoretical analysis for the resulting algorithm, showing that its performance is on par with previous, inefficient solutions. Our main contribution is showing that, despite the relatively large variance induced by the GR procedure, our performance guarantees hold with high probability rather than only in expectation. As a side result, we also improve the best known regret bounds for FPL in online combinatorial optimization with full feedback, closing the perceived performance gap between FPL and exponential weights in this setting.

Includes members:
  Member "online linear optimization via smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning with differentiable perturbed optimizers")
  Member "prediction by random walk perturbation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimax regret of switching constrained online convex optimization no phase transition")
  Member "an efficient algorithm for learning with semi bandit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient and robust algorithms for adversarial linear contextual bandits")
  Member "towards minimax policies for online linear optimization with bandit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "regret bounds for batched bandits")
  Member "regret in online combinatorial optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient and robust algorithms for adversarial linear contextual bandits")
  Member "regret analysis of stochastic and nonstochastic multi armed bandit problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi source domain adaptation for text classification via distancenet bandits")
  Member "contextual bandit algorithms with supervised learning guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "neural contextual bandits with ucb based exploration")
  Member "the on line shortest path problem under partial monitoring":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "upper confidence primal dual optimization stochastically constrained markov decision processes with adversarial losses and unknown transitions")

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)