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 "hardware guided symbiotic training for compact accurate yet execution efficient lstm"):
  Abstract: Many long short-term memory (LSTM) applications need fast yet compact models. Neural network compression approaches, such as the grow-and-prune paradigm, have proved to be promising for cutting down network complexity by skipping insignificant weights. However, current compression strategies are mostly hardware-agnostic and network complexity reduction does not always translate into execution efficiency. In this work, we propose a hardware-guided symbiotic training methodology for compact, accurate, yet execution-efficient inference models. It is based on our observation that hardware may introduce substantial non-monotonic behavior, which we call the latency hysteresis effect, when evaluating network size vs. inference latency. This observation raises question about the mainstream smaller-dimension-is-better compression strategy, which often leads to a sub-optimal model architecture. By leveraging the hardware-impacted hysteresis effect and sparsity, we are able to achieve the symbiosis of model compactness and accuracy with execution efficiency, thus reducing LSTM latency while increasing its accuracy. We have evaluated our algorithms on language modeling and speech recognition applications. Relative to the traditional stacked LSTM architecture obtained for the Penn Treebank dataset, we reduce the number of parameters by 18.0x (30.5x) and measured run-time latency by up to 2.4x (5.2x) on Nvidia GPUs (Intel Xeon CPUs) without any accuracy degradation. For the DeepSpeech2 architecture obtained for the AN4 dataset, we reduce the number of parameters by 7.0x (19.4x), word error rate from 12.9% to 9.9% (10.4%), and measured run-time latency by up to 1.7x (2.4x) on Nvidia GPUs (Intel Xeon CPUs). Thus, our method yields compact, accurate, yet execution-efficient inference models.

Includes members:
  Member "shufflenet v2 practical guidelines for efficient cnn architecture design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "post training piecewise linear quantization for deep neural networks")
  Member "deepheart semi supervised sequence learning for cardiovascular risk prediction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep learning in cardiology")
  Member "an analysis of neural language modeling at multiple scales":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the implicit and explicit regularization effects of dropout")
  Member "chamnet towards efficient network design through platform aware model adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "metapruning meta learning for automatic neural network channel pruning")
  Member "grow and prune compact fast and accurate lstms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "recurrent neural networks an embedded computing perspective")
  Member "adam admm a unified systematic framework of structured weight pruning for dnns":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a privacy preserving dnn pruning and mobile acceleration framework")
  Member "block sparse recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "block wise dynamic sparseness")
  Member "mnasnet platform aware neural architecture search for mobile":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "automl zero evolving machine learning algorithms from scratch")

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)