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 "polynomial time algorithms for multiple arm identification with full bandit feedback"):
  Abstract: We study the problem of stochastic combinatorial pure exploration (CPE), where an agent sequentially pulls a set of single arms (a.k.a. a super arm) and tries to find the best super arm. Among a variety of problem settings of the CPE, we focus on the full-bandit setting, where we cannot observe the reward of each single arm, but only the sum of the rewards. Although we can regard the CPE with full-bandit feedback as a special case of pure exploration in linear bandits, an approach based on linear bandits is not computationally feasible since the number of super arms may be exponential. In this paper, we first propose a polynomial-time bandit algorithm for the CPE under general combinatorial constraints and provide an upper bound of the sample complexity. Second, we design an approximation algorithm for the 0-1 quadratic maximization problem, which arises in many bandit algorithms with confidence ellipsoids. Based on our approximation algorithm, we propose novel bandit algorithms for the top-k selection problem, and prove that our algorithms run in polynomial time. Finally, we conduct experiments on synthetic and real-world datasets, and confirm the validity of our theoretical analysis in terms of both the computation time and the sample complexity.

Includes members:
  Member "pac identification of many good arms in stochastic multi armed bandits":
    also connected through other hyperedges:
      (none)
  Member "nearly optimal sampling algorithms for combinatorial pure exploration":
    also connected through other hyperedges:
      (none)
  Member "multiple play bandits in the position based model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unbiased learning to rank counterfactual and online approaches")
  Member "pure exploration of multi armed bandit under matroid constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polynomial time algorithms for combinatorial pure exploration with full bandit feedback")
  Member "approximation of the quadratic knapsack problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomial time algorithms for combinatorial pure exploration with full bandit feedback")
  Member "on the optimal sample complexity for best arm identification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial time algorithms for combinatorial pure exploration with full bandit feedback")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "best arm identification in linear bandits":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sublinear optimal policy value estimation in contextual bandits")

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)