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 "the limitations of optimization from samples"):
  Abstract: In this paper we consider the following question: can we optimize objective functions from the training data we use to learn them? We formalize this question through a novel framework we call optimization from samples (OPS). In OPS, we are given sampled values of a function drawn from some distribution and the objective is to optimize the function under some constraint. #R##N#While there are interesting classes of functions that can be optimized from samples, our main result is an impossibility. We show that there are classes of functions which are statistically learnable and optimizable, but for which no reasonable approximation for optimization from samples is achievable. In particular, our main result shows that there is no constant factor approximation for maximizing coverage functions under a cardinality constraint using polynomially-many samples drawn from any distribution. #R##N#We also show tight approximation guarantees for maximization under a cardinality constraint of several interesting classes of functions including unit-demand, additive, and general monotone submodular functions, as well as a constant factor approximation for monotone submodular functions with bounded curvature.

Includes members:
  Member "introduction to online convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "online submodular welfare maximization greedy beats 1 2 in random order":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "submodular optimization under noise":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "searching trees with permanently noisy advice walking and query algorithms")
  Member "robust influence maximization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mixed strategies for robust optimization of unknown objectives")
  Member "the sample complexity of revenue maximization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "the pseudo dimension of near optimal auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "settling the sample complexity of single parameter revenue maximization")
  Member "local distribution and the symmetry gap approximability of multiway partitioning problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimizing item and subgroup configurations for social aware vr shopping")
  Member "mixture selection mechanism design and signaling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of contracts")

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.DS(Data Structures and Algorithms)