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 "global sparse momentum sgd for pruning very deep neural networks"):
  Abstract: Deep Neural Network (DNN) is powerful but computationally expensive and memory intensive, thus impeding its practical usage on resource-constrained front-end devices. DNN pruning is an approach for deep model compression, which aims at eliminating some parameters with tolerable performance degradation. In this paper, we propose a novel momentum-SGD-based optimization method to reduce the network complexity by on-the-fly pruning. Concretely, given a global compression ratio, we categorize all the parameters into two parts at each training iteration which are updated using different rules. In this way, we gradually zero out the redundant parameters, as we update them using only the ordinary weight decay but no gradients derived from the objective function. As a departure from prior methods that require heavy human works to tune the layer-wise sparsity ratios, prune by solving complicated non-differentiable problems or finetune the model after pruning, our method is characterized by 1) global compression that automatically finds the appropriate per-layer sparsity ratios; 2) end-to-end training; 3) no need for a time-consuming re-training process after pruning; and 4) superior capability to find better winning tickets which have won the initialization lottery.

Includes members:
  Member "metapruning meta learning for automatic neural network channel pruning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "localizing multi scale semantic patches for image classification")
  Member "towards compact convnets via structure sparsity regularized filter pruning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards optimal structured cnn pruning via generative adversarial learning")
  Member "approximated oracle filter pruning for destructive cnn width optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "centripetal sgd for pruning very deep convolutional networks with complicated structure":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "faster gaze prediction with dense networks and fisher pruning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "bi real net enhancing the performance of 1 bit cnns with improved representational capability and advanced training algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning architectures for binary networks")
  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 "a systematic dnn weight pruning framework using alternating direction method of multipliers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")

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)