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 "momentum improves normalized sgd"):
  Abstract: We provide an improved analysis of normalized SGD showing that adding momentum provably removes the need for large batch sizes on non-convex objectives. Then, we consider the case of objectives with bounded second derivative and show that in this case a small tweak to the momentum formula allows normalized SGD with momentum to find an $\epsilon$-critical point in $O(1/\epsilon^{3.5})$ iterations, matching the best-known rates without accruing any logarithmic factors or dependence on dimension. We also provide an adaptive method that automatically improves convergence rates when the variance in the gradients is small. Finally, we show that our method is effective when employed on popular large scale tasks such as ResNet-50 and BERT pretraining, matching the performance of the disparate methods used to get state-of-the-art results on both tasks.

Includes members:
  Member "reducing the variance in online optimization by transporting past gradients":
    also connected through other hyperedges:
      (none)
  Member "memory efficient adaptive optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "low memory neural network training a technical report")
  Member "momentum based variance reduction in non convex sgd":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a hybrid stochastic policy gradient algorithm for reinforcement learning")
  Member "reducing bert pre training time from 3 days to 76 minutes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "on the convergence of adam and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "stochastic nested variance reduction for nonconvex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a hybrid stochastic policy gradient algorithm for reinforcement learning")
  Member "bert pre training of deep bidirectional transformers for language understanding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "adafactor adaptive learning rates with sublinear memory cost":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "disentangling adaptive gradient methods from learning rates")

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)