human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the convergence of a class of adam type algorithms for non convex optimization"
  Abstract: This paper studies a class of adaptive gradient based momentum algorithms that update the search directions and learning rates simultaneously using past gradients. This class, which we refer to as the "Adam-type", includes the popular algorithms such as the Adam, AMSGrad and AdaGrad. Despite their popularity in training deep neural networks, the convergence of these algorithms for solving nonconvex problems remains an open question. This paper provides a set of mild sufficient conditions that guarantee the convergence for the Adam-type methods. We prove that under our derived conditions, these methods can achieve the convergence rate of order $O(\log{T}/\sqrt{T})$ for nonconvex stochastic optimization. We show the conditions are essential in the sense that violating them may make the algorithm diverge. Moreover, we propose and analyze a class of (deterministic) incremental adaptive gradient algorithms, which has the same $O(\log{T}/\sqrt{T})$ convergence rate. Our study could also be extended to a broader class of adaptive gradient methods in machine learning and optimization.

Connected through hyperedge HE-1 (induced by source paper "non asymptotic convergence of adam type reinforcement learning algorithms under markovian sampling"):
  with members:
    - "finite time error bounds for linear stochastic approximation and td learning"
    - "an improved convergence analysis of stochastic variance reduced policy gradient"
    - "two time scale off policy td learning non asymptotic analysis over markovian samples"
    - "on the convergence proof of amsgrad and a new version"
    - "smoothing policies and safe policy gradients"
    - "finite sample analysis for sarsa with linear function approximation"
    - "characterizing the exact behaviors of temporal difference learning algorithms using markov jump linear system theory"
    - "neural temporal difference learning converges to global optima"

Connected through hyperedge HE-2 (induced by source paper "laprop a better way to combine momentum with adaptive gradient"):
  with members:
    - "fairseq a fast extensible toolkit for sequence modeling"
    - "gluoncv and gluonnlp deep learning in computer vision and natural language processing"
    - "optimization for deep learning theory and algorithms"
    - "on the variance of the adaptive learning rate and beyond"
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "on the convergence of adam and beyond"
    - "roberta a robustly optimized bert pretraining approach"
    - "gradient descent finds global minima of deep neural networks"

Connected through hyperedge HE-3 (induced by source paper "deam adaptive momentum with discriminative weight for stochastic optimization"):
  with members:
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "on the convergence of adam and beyond"
    - "graph neural networks for small graph and giant network representation learning an overview"
    - "normalized direction preserving adam"
    - "convergence analysis of proximal gradient with momentum for nonconvex optimization"
    - "improving generalization performance by switching from adam to sgd"
    - "an overview of gradient descent optimization algorithms"
    - "on variance reduction in stochastic gradient descent and its asynchronous variants"

Connected through hyperedge HE-4 (induced by source paper "adamt a stochastic optimization with trend correction scheme"):
  with members:
    - "on the convergence of adam and beyond"
    - "on the convergence of adaptive gradient methods for nonconvex optimization"
    - "a sufficient condition for convergences of adam and rmsprop"
    - "closing the generalization gap of adaptive gradient methods in training deep neural networks"
    - "weighted adagrad with unified momentum"
    - "decoupled weight decay regularization"
    - "fashion mnist a novel image dataset for benchmarking machine learning algorithms"
    - "an overview of gradient descent optimization algorithms"

Connected through hyperedge HE-5 (induced by source paper "on empirical comparisons of optimizers for deep learning"):
  with members:
    - "which algorithmic choices matter at which batch sizes insights from a noisy quadratic model"
    - "on the variance of the adaptive learning rate and beyond"
    - "namsg an efficient method for training neural networks"
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "deepobs a deep learning optimizer benchmark suite"
    - "on the convergence of adam and beyond"
    - "efficientnet rethinking model scaling for convolutional neural networks"
    - "roberta a robustly optimized bert pretraining approach"

Connected through hyperedge HE-6 (induced by source paper "training neural networks for and by interpolation"):
  with members:
    - "sgd converges to global minimum in deep learning via star convex path"
    - "painless stochastic gradient interpolation line search and convergence rates"
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "deepobs a deep learning optimizer benchmark suite"
    - "on the convergence of adam and beyond"
    - "l4 practical loss based stepsize adaptation for deep learning"
    - "fast and faster convergence of sgd for over parameterized models and an accelerated perceptron"
    - "deep frank wolfe for neural network optimization"

Connected through hyperedge HE-7 (induced by source paper "calibrating the adaptive learning rate to improve convergence of adam"):
  with members:
    - "escaping saddle points with adaptive gradient methods"
    - "adaptive gradient methods with dynamic bound of learning rate"
    - "on the convergence of adam and beyond"
    - "on the convergence of adaptive gradient methods for nonconvex optimization"
    - "closing the generalization gap of adaptive gradient methods in training deep neural networks"
    - "an alternative view when does sgd escape local minima"
    - "convergence guarantees for rmsprop and adam in non convex optimization and an empirical comparison to nesterov acceleration"
    - "regularizing and optimizing lstm language models"

Connected through hyperedge HE-8 (induced by source paper "zo adamm zeroth order adaptive momentum method for black box optimization"):
  with members:
    - "on the convergence proof of amsgrad and a new version"
    - "on the convergence of adam and beyond"
    - "autozoom autoencoder based zeroth order optimization method for attacking black box neural networks"
    - "on the convergence of adaptive gradient methods for nonconvex optimization"
    - "zeroth order stochastic variance reduction for nonconvex optimization"
    - "closing the generalization gap of adaptive gradient methods in training deep neural networks"
    - "signsgd compressed optimisation for non convex problems"
    - "black box adversarial attacks with limited queries and information"

Question: Please tell me which class the center node 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)