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 "black box submodular maximization discrete and continuous settings"):
  Abstract: In this paper, we consider the problem of black box continuous submodular maximization where we only have access to the function values and no information about the derivatives is provided. For a monotone and continuous DR-submodular function, and subject to a bounded convex body constraint, we propose Black-box Continuous Greedy, a derivative-free algorithm that provably achieves the tight $[(1-1/e)OPT-\epsilon]$ approximation guarantee with $O(d/\epsilon^3)$ function evaluations. We then extend our result to the stochastic setting where function values are subject to stochastic zero-mean noise. It is through this stochastic generalization that we revisit the discrete submodular maximization problem and use the multi-linear extension as a bridge between discrete and continuous settings. Finally, we extensively evaluate the performance of our algorithm on continuous and discrete submodular objective functions using both synthetic and real data.

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 continuous submodular maximization from full information to bandit feedback":
    also connected through other hyperedges:
      (none)
  Member "optimal dr submodular maximization and applications to provable mean field inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online continuous submodular maximization from full information to bandit feedback")
  Member "black box adversarial attacks with limited queries and information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "universal adversarial attack on attention and the resulting dataset damagenet")
  Member "discrete adversarial attacks and submodular optimization with applications to text classification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "g odel s sentence is an adversarial example but unsolvable")
  Member "weakly submodular maximization beyond cardinality constraints does randomization help greedy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond submodular maximization")
  Member "gradient methods for submodular maximization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adaptive sequence submodularity")
  Member "continuous dr submodular maximization structure and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "provable non convex optimization and algorithm validation via submodularity")

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)