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 "model slicing for supporting complex analytics with elastic inference cost and resource constraints"):
  Abstract: Deep learning models have been used to support analytics beyond simple aggregation, where deeper and wider models have been shown to yield great results. These models consume a huge amount of memory and computational operations. However, most of the large-scale industrial applications are often computational budget constrained. Current solutions are mainly based on model compression -- deploying a smaller model to save the computational resources. Meanwhile, the peak workload of inference service could be 10x higher than the average cases, with even unpredictable extreme cases. Lots of computational resources could be wasted during off-peak hours. On the other hand, the system may crash when the workload exceeds system design. Supporting such deep learning service with dynamic workload cost-efficiently remains to be a challenging problem. We address this conflict with a general and novel training scheme called model slicing, which enables deep learning models to provide predictions within prescribed computational resource budget dynamically. Model slicing could be viewed as an elastic computation solution without requiring more computation resources, but by slightly sacrificing prediction accuracy. In a nutshell, partially ordered relation is introduced to the basic components of each layer in the model, namely neurons in dense layers and channels in convolutional layers. Specifically, if one component participates in the forward pass, then all of its preceding components are also activated. Dynamically trained under such structural constraint, we can slice a narrower sub-model during inference whose run-time memory and computational operation consumption is roughly quadratic to the width controlled by a single parameter slice rate. Extensive experiments show that models trained with model slicing can support elastic inference cost effectively with minimum performance loss.

Includes members:
  Member "isbnet instance aware selective branching networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reducing catastrophic forgetting in modular neural networks by dynamic information balancing")
  Member "group normalization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on feature normalization and data augmentation")
  Member "slimmable neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "switchable precision neural networks")
  Member "skipnet learning dynamic routing in convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "switchable precision neural networks")
  Member "outrageously large neural networks the sparsely gated mixture of experts layer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "attention over parameters for dialogue systems")
  Member "shufflenet an extremely efficient convolutional neural network for mobile devices":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "post training piecewise linear quantization for deep neural networks")
  Member "learning efficient convolutional networks through network slimming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learning anytime predictions in neural networks via adaptive loss balancing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "resolution adaptive networks for efficient inference")

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)