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 "zo adamm zeroth order adaptive momentum method for black box optimization"):
  Abstract: The adaptive momentum method (AdaMM), which uses past gradients to update descent directions and learning rates simultaneously, has become one of the most popular first-order optimization methods for solving machine learning problems. However, AdaMM is not suited for solving black-box optimization problems, where explicit gradient forms are difficult or infeasible to obtain. In this paper, we propose a zeroth-order AdaMM (ZO-AdaMM) algorithm, that generalizes AdaMM to the gradient-free regime. We show that the convergence rate of ZO-AdaMM for both convex and nonconvex optimization is roughly a factor of $O(\sqrt{d})$ worse than that of the first-order AdaMM algorithm, where $d$ is problem size. In particular, we provide a deep understanding on why Mahalanobis distance matters in convergence of ZO-AdaMM and other AdaMM-type methods. As a byproduct, our analysis makes the first step toward understanding adaptive learning rate methods for nonconvex constrained optimization. Furthermore, we demonstrate two applications, designing per-image and universal adversarial attacks from black-box neural networks, respectively. We perform extensive experiments on ImageNet and empirically show that ZO-AdaMM converges much faster to a solution of high accuracy compared with $6$ state-of-the-art ZO optimization methods.

Includes members:
  Member "on the convergence proof of amsgrad and a new version":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non asymptotic convergence of adam type reinforcement learning algorithms under markovian sampling")
  Member "on the convergence of adam and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "autozoom autoencoder based zeroth order optimization method for attacking black box neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of black box adversarial attacks on computer vision models")
  Member "on the convergence of adaptive gradient methods for nonconvex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "non asymptotic convergence of adam type reinforcement learning algorithms under markovian sampling")
  Member "zeroth order stochastic variance reduction for nonconvex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards an efficient and general framework of robust training for graph neural networks")
  Member "closing the generalization gap of adaptive gradient methods in training deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "signsgd compressed optimisation for non convex problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "black box adversarial attacks with limited queries and information":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "universal adversarial attack on attention and the resulting dataset damagenet")

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)