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 "efficient network construction through structural plasticity"):
  Abstract: Deep Neural Networks (DNNs) on hardware is facing excessive computation cost due to the massive number of parameters. A typical training pipeline to mitigate over-parameterization is to pre-define a DNN structure first with redundant learning units (filters and neurons) under the goal of high accuracy, then to prune redundant learning units after training with the purpose of efficient inference. We argue that it is sub-optimal to introduce redundancy into training for the purpose of reducing redundancy later in inference. Moreover, the fixed network structure further results in poor adaption to dynamic tasks, such as lifelong learning. In contrast, structural plasticity plays an indispensable role in mammalian brains to achieve compact and accurate learning. Throughout the lifetime, active connections are continuously created while those no longer important are degenerated. Inspired by such observation, we propose a training scheme, namely Continuous Growth and Pruning (CGaP), where we start the training from a small network seed, then literally execute continuous growth by adding important learning units and finally prune secondary ones for efficient inference. The inference model generated from CGaP is sparse in the structure, largely decreasing the inference power and latency when deployed on hardware platforms. With popular DNN structures on representative datasets, the efficacy of CGaP is benchmarked by both algorithm simulation and architectural modeling on Field-programmable Gate Arrays (FPGA). For example, CGaP decreases the FLOPs, model size, DRAM access energy and inference latency by 63.3%, 64.0%, 11.8% and 40.2%, respectively, for ResNet-110 on CIFAR-10.

Includes members:
  Member "amc automl for model compression and acceleration on mobile devices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "soft filter pruning for accelerating deep convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "rethinking the value of network pruning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learning efficient convolutional networks through network slimming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discrimination aware network pruning for deep model compression")
  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 "thinet a filter level pruning method for deep neural network compression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "nest a neural network synthesis tool based on a grow and prune paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")
  Member "learning structured sparsity in deep neural networks":
    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.NE(Neural and Evolutionary Computing)