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 "inductive bias of gradient descent based adversarial training on separable data"):
  Abstract: Adversarial training is a principled approach for training robust neural networks. Despite of tremendous successes in practice, its theoretical properties still remain largely unexplored. In this paper, we provide new theoretical insights of gradient descent based adversarial training by studying its computational properties, specifically on its inductive bias. We take the binary classification task on linearly separable data as an illustrative example, where the loss asymptotically attains its infimum as the parameter diverges to infinity along certain directions. Specifically, we show that when the adversarial perturbation during training has bounded $\ell_2$-norm, the classifier learned by gradient descent based adversarial training converges in direction to the maximum $\ell_2$-norm margin classifier at the rate of $\tilde{\mathcal{O}}(1/\sqrt{T})$, significantly faster than the rate $\mathcal{O}(1/\log T)$ of training with clean data. In addition, when the adversarial perturbation during training has bounded $\ell_q$-norm for some $q\ge 1$, the resulting classifier converges in direction to a maximum mixed-norm margin classifier, which has a natural interpretation of robustness, as being the maximum $\ell_2$-norm margin classifier under worst-case $\ell_q$-norm perturbation to the data. Our findings provide theoretical backups for adversarial training that it indeed promotes robustness against adversarial perturbation.

Includes members:
  Member "convergence and margin of adversarial training on separable data":
    also connected through other hyperedges:
      (none)
  Member "feature denoising for improving adversarial robustness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial ranking attack and defense")
  Member "implicit bias of gradient descent on linear convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "gradient descent aligns the layers of deep linear networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the global convergence of training deep linear resnets")
  Member "risk and parameter convergence of logistic regression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a generalization theory of gradient descent for learning over parameterized deep relu networks")
  Member "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adversarial ranking attack and defense")
  Member "sgd learns over parameterized networks that provably generalize on linearly separable data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the global convergence of training deep linear resnets")
  Member "adversarial example defenses ensembles of weak defenses are not strong":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial ranking attack and defense")

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)