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 adam and beyond"
  Abstract: Several recently proposed stochastic optimization methods that have been successfully used in training deep networks such as RMSProp, Adam, Adadelta, Nadam are based on using gradient updates scaled by square roots of exponential moving averages of squared past gradients. In many applications, e.g. learning with large output spaces, it has been empirically observed that these algorithms fail to converge to an optimal solution (or a critical point in nonconvex settings). We show that one cause for such failures is the exponential moving average used in the algorithms. We provide an explicit example of a simple convex optimization setting where Adam does not converge to the optimal solution, and describe the precise problems with the previous analysis of Adam algorithm. Our analysis suggests that the convergence issues can be fixed by endowing such algorithms with `long-term memory' of past gradients, and propose new variants of the Adam algorithm which not only fix the convergence issues but often also lead to improved empirical performance.

Connected through hyperedge HE-1 (induced by source paper "disentangling adaptive gradient methods from learning rates"):
  with members:
    - "the step decay schedule a near optimal geometrically decaying learning rate procedure for least squares"
    - "extreme tensoring for low memory preconditioning"
    - "on empirical comparisons of optimizers for deep learning"
    - "lingvo a modular and scalable framework for sequence to sequence modeling"
    - "stochastic gradient methods with layer wise adaptive moments for training of deep networks"
    - "escaping saddle points with adaptive gradient methods"
    - "an exponential learning rate schedule for deep learning"
    - "deepobs a deep learning optimizer benchmark suite"

Connected through hyperedge HE-2 (induced by source paper "building computationally efficient and well generalizing person re identification models with metric learning"):
  with members:
    - "deep learning for person re identification a survey and outlook"
    - "rethinking person re identification with confidence"
    - "res2net a new multi scale backbone architecture"
    - "omni scale feature learning for person re identification"
    - "attention a big surprise for cross domain person re identification"
    - "searching for a robust neural architecture in four gpu hours"
    - "spherereid deep hypersphere manifold embedding for person re identification"
    - "unsupervised person re identification by soft multilabel learning"

Connected through hyperedge HE-3 (induced by source paper "π nets deep polynomial neural networks"):
  with members:
    - "implicit generation and generalization in energy based models"
    - "polygan high order polynomial generators"
    - "semantic image synthesis with spatially adaptive normalization"
    - "on the expressive power of deep polynomial neural networks"
    - "adversarial training of partially invertible variational autoencoders"
    - "generating 3d faces using convolutional mesh autoencoders"
    - "residual networks of residual networks multilevel residual networks"
    - "mixed link networks"

Connected through hyperedge HE-4 (induced by source paper "dense dilated convolutions merging network for land cover classification"):
  with members:
    - "albumentations fast and flexible image augmentations"
    - "dense fusion classmate network for land cover classification"
    - "dense dilated convolutions merging network for semantic mapping of remote sensing images"
    - "sdc stacked dilated convolution a unified descriptor network for dense matching tasks"
    - "uncertainty gated network for land cover segmentation"
    - "deepglobe 2018 a challenge to parse the earth through satellite images"
    - "urban land cover classification with missing data modalities using deep convolutional neural networks"
    - "rifcn recurrent network in fully convolutional network for semantic segmentation of high resolution remote sensing images"

Connected through hyperedge HE-5 (induced by source paper "template based unseen instance detection"):
  with members:
    - "deepim deep iterative matching for 6d pose estimation"
    - "deceptionnet network driven domain randomization"
    - "learning to track any object"
    - "photorealistic image synthesis for object instance detection"
    - "target aware deep tracking"
    - "deep model based 6d pose refinement in rgb"
    - "bop benchmark for 6d object pose estimation"
    - "deep object pose estimation for semantic robotic grasping of household objects"

Connected through hyperedge HE-6 (induced by source paper "unsupervised learning of camera pose with compositional re estimation"):
  with members:
    - "unsupervised learning of monocular depth estimation and visual odometry with deep feature reconstruction"
    - "unsupervised learning of depth and ego motion from monocular video using 3d geometric constraints"
    - "deep ordinal regression network for monocular depth estimation"
    - "ls vo learning dense optical subspace for robust visual odometry estimation"
    - "geonet unsupervised learning of dense depth optical flow and camera pose"
    - "every pixel counts joint learning of geometry and motion with 3d holistic understanding"
    - "megadepth learning single view depth prediction from internet photos"
    - "ba net dense bundle adjustment network"

Connected through hyperedge HE-7 (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-8 (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"
    - "roberta a robustly optimized bert pretraining approach"
    - "gradient descent finds global minima of deep neural networks"
    - "a general system of differential equations to model first order adaptive algorithms"

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)