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 "adversarially robust generalization just requires more unlabeled data"):
  Abstract: Neural network robustness has recently been highlighted by the existence of adversarial examples. Many previous works show that the learned networks do not perform well on perturbed test data, and significantly more labeled data is required to achieve adversarially robust generalization. In this paper, we theoretically and empirically show that with just more unlabeled data, we can learn a model with better adversarially robust generalization. The key insight of our results is based on a risk decomposition theorem, in which the expected robust risk is separated into two parts: the stability part which measures the prediction stability in the presence of perturbations, and the accuracy part which evaluates the standard classification accuracy. As the stability part does not depend on any label information, we can optimize this part using unlabeled data. We further prove that for a specific Gaussian mixture problem, adversarially robust generalization can be almost as easy as the standard generalization in supervised learning if a sufficiently large amount of unlabeled data is provided. Inspired by the theoretical findings, we further show that a practical adversarial training algorithm that leverages unlabeled data can improve adversarial robust generalization on MNIST and Cifar-10.

Includes members:
  Member "convergence of adversarial training in overparametrized neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cat customized adversarial training for improved robustness")
  Member "adversarial training for free":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "nattack learning the distributions of adversarial examples for an improved black box attack on deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "there are many consistent explanations of unlabeled data why you should average":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proposal learning for semi supervised object detection")
  Member "adversarial vulnerability for any classifier":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "utilizing network properties to detect erroneous inputs")
  Member "encoder decoder with atrous separable convolution for semantic image segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning enriched features for real image restoration and enhancement")
  Member "obfuscated gradients give a false sense of security circumventing defenses to adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adversarial ranking attack and defense")
  Member "non local neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning enriched features for real image restoration and enhancement")

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)