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 "dynamic runtime feature map pruning"):
  Abstract: High bandwidth requirements are an obstacle for accelerating the training and inference of deep neural networks. Most previous research focuses on reducing the size of kernel maps for inference. We analyze parameter sparsity of six popular convolutional neural networks - AlexNet, MobileNet, ResNet-50, SqueezeNet, TinyNet, and VGG16. Of the networks considered, those using ReLU (AlexNet, SqueezeNet, VGG16) contain a high percentage of 0-valued parameters and can be statically pruned. Networks with Non-ReLU activation functions in some cases may not contain any 0-valued parameters (ResNet-50, TinyNet). We also investigate runtime feature map usage and find that input feature maps comprise the majority of bandwidth requirements when depth-wise convolution and point-wise convolutions used. We introduce dynamic runtime pruning of feature maps and show that 10% of dynamic feature map execution can be removed without loss of accuracy. We then extend dynamic pruning to allow for values within an epsilon of zero and show a further 5% reduction of feature map loading with a 1% loss of accuracy in top-1.

Includes members:
  Member "mixed precision training of convolutional neural networks using integer operations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sparse weight activation training")
  Member "learning to prune filters in convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sasl saliency adaptive sparsity learning for neural network acceleration")
  Member "sbnet sparse blocks network for fast inference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "progressive gradient pruning for classification detection and domainadaptation")
  Member "nisp pruning networks using neuron importance score propagation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "quantization and training of neural networks for efficient integer arithmetic only inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "searching for winograd aware quantized networks")
  Member "efficient processing of deep neural networks a tutorial and survey":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "searching for winograd aware quantized networks")
  Member "extremely low bit neural network squeeze the last bit out with admm":
    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 "dynamic routing between capsules":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lightweight residual densely connected convolutional neural network")

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)