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 "an adaptive and momental bound method for stochastic learning"):
  Abstract: Training deep neural networks requires intricate initialization and careful selection of learning rates. The emergence of stochastic gradient optimization methods that use adaptive learning rates based on squared past gradients, e.g., AdaGrad, AdaDelta, and Adam, eases the job slightly. However, such methods have also been proven problematic in recent studies with their own pitfalls including non-convergence issues and so on. Alternative variants have been proposed for enhancement, such as AMSGrad, AdaShift and AdaBound. In this work, we identify a new problem of adaptive learning rate methods that exhibits at the beginning of learning where Adam produces extremely large learning rates that inhibit the start of learning. We propose the Adaptive and Momental Bound (AdaMod) method to restrict the adaptive learning rates with adaptive and momental upper bounds. The dynamic learning rate bounds are based on the exponential moving averages of the adaptive learning rates themselves, which smooth out unexpected large learning rates and stabilize the training of deep neural networks. Our experiments verify that AdaMod eliminates the extremely large learning rates throughout the training and brings significant improvements especially on complex networks such as DenseNet and Transformer, compared to Adam. Our implementation is available at: this https URL

Includes members:
  Member "fairseq a fast extensible toolkit for sequence modeling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "train large then compress rethinking model size for efficient training and inference of transformers")
  Member "adaptive gradient methods with dynamic bound of learning rate":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a metric learning reality check")
  Member "transformer xl attentive language models beyond a fixed length context":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on contextual embeddings")
  Member "fixup initialization residual learning without normalization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rethinking batch normalization in transformers")
  Member "on the convergence of adam and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "a closer look at deep learning heuristics learning rate restarts warmup and distillation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "adashift decorrelation and convergence of adaptive learning rate methods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on empirical comparisons of optimizers for deep learning")
  Member "adafactor adaptive learning rates with sublinear memory cost":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)