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 "tea dnn the quest for time energy accuracy co optimized deep neural networks"):
  Abstract: Embedded deep learning platforms have witnessed two simultaneous improvements. First, the accuracy of convolutional neural networks (CNNs) has been significantly improved through the use of automated neural-architecture search (NAS) algorithms to determine CNN structure. Second, there has been increasing interest in developing application-specific platforms for CNNs that provide improved inference performance and energy consumption as compared to GPUs. Embedded deep learning platforms differ in the amount of compute resources and memory-access bandwidth, which would affect performance and energy consumption of CNNs. It is therefore critical to consider the available hardware resources in the network architecture search. To this end, we introduce TEA-DNN, a NAS algorithm targeting multi-objective optimization of execution time, energy consumption, and classification accuracy of CNN workloads on embedded architectures. TEA-DNN leverages energy and execution time measurements on embedded hardware when exploring the Pareto-optimal curves across accuracy, execution time, and energy consumption and does not require additional effort to model the underlying hardware. We apply TEA-DNN for image classification on actual embedded platforms (NVIDIA Jetson TX2 and Intel Movidius Neural Compute Stick). We highlight the Pareto-optimal operating points that emphasize the necessity to explicitly consider hardware characteristics in the search process. To the best of our knowledge, this is the most comprehensive study of Pareto-optimal models across a range of hardware platforms using actual measurements on hardware to obtain objective values.

Includes members:
  Member "dpp net device aware progressive search for pareto optimal neural architectures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "mnasnet platform aware neural architecture search for mobile":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "shufflenet an extremely efficient convolutional neural network for mobile devices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "post training piecewise linear quantization for deep neural networks")
  Member "progressive neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "learning transferable architectures for scalable image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "meta learning curiosity algorithms")
  Member "mobilenets efficient convolutional neural networks for mobile vision applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "condensenet an efficient densenet using learned group convolutions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "hyperpower power and memory constrained hyper parameter optimization for neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "single path mobile automl efficient convnet design and nas hyperparameter optimization")

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)