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 "stochastic nonconvex optimization with large minibatches"):
  Abstract: We study stochastic optimization of nonconvex loss functions, which are typical objectives for training neural networks. We propose stochastic approximation algorithms which optimize a series of regularized, nonlinearized losses on large minibatches of samples, using only first-order gradient information. Our algorithms provably converge to an approximate critical point of the expected objective with faster rates than minibatch stochastic gradient descent, and facilitate better parallelization by allowing larger minibatches.

Includes members:
  Member "memory and communication efficient distributed stochastic optimization with minibatch prox":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "is local sgd better than minibatch sgd")
  Member "accurate large minibatch sgd training imagenet in 1 hour":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning representations by predicting bags of visual words")
  Member "without replacement sampling for stochastic gradient methods convergence results and application to distributed optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "high probability generalization bounds for uniformly stable algorithms with nearly optimal rate")
  Member "incremental aggregated proximal and augmented lagrangian algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "memory and communication efficient distributed stochastic optimization with minibatch prox")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "communication efficient distributed optimization using an approximate newton type method":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scaffold stochastic controlled averaging for federated learning")
  Member "adadelta an adaptive learning rate method":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "convergence rates of inexact proximal gradient methods for convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "credit assignment techniques in stochastic computation graphs")

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)