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 "progressive dnn compression a key to achieve ultra high weight pruning and quantization rates using admm"):
  Abstract: Weight pruning and weight quantization are two important categories of DNN model compression. Prior work on these techniques are mainly based on heuristics. A recent work developed a systematic frame-work of DNN weight pruning using the advanced optimization technique ADMM (Alternating Direction Methods of Multipliers), achieving one of state-of-art in weight pruning results. In this work, we first extend such one-shot ADMM-based framework to guarantee solution feasibility and provide fast convergence rate, and generalize to weight quantization as well. We have further developed a multi-step, progressive DNN weight pruning and quantization framework, with dual benefits of (i) achieving further weight pruning/quantization thanks to the special property of ADMM regularization, and (ii) reducing the search space within each step. Extensive experimental results demonstrate the superior performance compared with prior work. Some highlights: (i) we achieve 246x,36x, and 8x weight pruning on LeNet-5, AlexNet, and ResNet-50 models, respectively, with (almost) zero accuracy loss; (ii) even a significant 61x weight pruning in AlexNet (ImageNet) results in only minor degradation in actual accuracy compared with prior work; (iii) we are among the first to derive notable weight pruning results for ResNet and MobileNet models; (iv) we derive the first lossless, fully binarized (for all layers) LeNet-5 for MNIST and VGG-16 for CIFAR-10; and (v) we derive the first fully binarized (for all layers) ResNet for ImageNet with reasonable accuracy loss.

Includes members:
  Member "demystifying neural network filter pruning":
    also connected through other hyperedges:
      (none)
  Member "mobilenetv2 inverted residuals and linear bottlenecks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "differentiable fine grained quantization for deep neural network compression":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non structured dnn weight pruning is it beneficial in any platform")
  Member "a systematic dnn weight pruning framework using alternating direction method of multipliers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")
  Member "adam admm a unified systematic framework of structured weight pruning for dnns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a privacy preserving dnn pruning and mobile acceleration framework")
  Member "extremely low bit neural network squeeze the last bit out with admm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")
  Member "exploring the regularity of sparse structure in convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")
  Member "incremental network quantization towards lossless cnns with low precision weights":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.NE(Neural and Evolutionary Computing)