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 "towards practical lottery ticket hypothesis for adversarial training"):
  Abstract: Recent research has proposed the lottery ticket hypothesis, suggesting that for a deep neural network, there exist trainable sub-networks performing equally or better than the original model with commensurate training steps. While this discovery is insightful, finding proper sub-networks requires iterative training and pruning. The high cost incurred limits the applications of the lottery ticket hypothesis. We show there exists a subset of the aforementioned sub-networks that converge significantly faster during the training process and thus can mitigate the cost issue. We conduct extensive experiments to show such sub-networks consistently exist across various model structures for a restrictive setting of hyperparameters ($e.g.$, carefully selected learning rate, pruning ratio, and model capacity). As a practical application of our findings, we demonstrate that such sub-networks can help in cutting down the total time of adversarial training, a standard approach to improve robustness, by up to 49\% on CIFAR-10 to achieve the state-of-the-art robustness.

Includes members:
  Member "towards compact and robust deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on pruning adversarially robust neural networks")
  Member "adversarial training for free":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "the difficulty of training sparse neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "picking winning tickets before training by preserving gradient flow")
  Member "sparse dnns with improved adversarial robustness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on pruning adversarially robust neural networks")
  Member "stochastic activation pruning for robust adversarial defense":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "post training piecewise linear quantization for deep neural networks")
  Member "to compress or not to compress understanding the interactions between adversarial attacks and neural network compression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards certifiable adversarial sample detection")
  Member "the lottery ticket hypothesis finding sparse trainable neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lossless compression of deep neural networks")
  Member "snip single shot network pruning based on connection sensitivity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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)