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 "sparse networks from scratch faster training without losing performance"):
  Abstract: We demonstrate the possibility of what we call sparse learning: accelerated training of deep neural networks that maintain sparse weights throughout training while achieving performance levels competitive with dense networks. We accomplish this by developing sparse momentum, an algorithm which uses exponentially smoothed gradients (momentum) to identify layers and weights which reduce the error efficiently. Sparse momentum redistributes pruned weights across layers according to the mean momentum magnitude of each layer. Within a layer, sparse momentum grows weights according to the momentum magnitude of zero-valued weights. We demonstrate state-of-the-art sparse performance on MNIST, CIFAR-10, and ImageNet, decreasing the mean error by a relative 8%, 15%, and 6% compared to other sparse algorithms. Furthermore, we show that our algorithm can reliably find the equivalent of winning lottery tickets from random initialization: Our algorithm finds sparse configurations with 20% or fewer weights which perform as well, or better than their dense counterparts. Sparse momentum also decreases the training time: It requires a single training run -- no re-training is required -- and increases training speed up to 11.85x. In our analysis, we show that our sparse networks might be able to reach dense performance levels by learning more general features which are useful to a broader range of classes than dense networks.

Includes members:
  Member "deconstructing lottery tickets zeros signs and the supermask":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learned threshold pruning")
  Member "generating long sequences with sparse transformers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "meta embeddings based on self attention")
  Member "parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "soft threshold weight reparameterization for learnable sparsity")
  Member "the state of sparsity in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "soft threshold weight reparameterization for learnable sparsity")
  Member "scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "campfire compressible regularization free structured sparse training for hardware accelerators")
  Member "the lottery ticket hypothesis finding sparse trainable neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lossless compression of deep neural networks")
  Member "bert pre training of deep bidirectional transformers for language understanding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  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)