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 "meta filter pruning to accelerate deep convolutional neural networks"):
  Abstract: Existing methods usually utilize pre-defined criterions, such as p-norm, to prune unimportant filters. There are two major limitations in these methods. First, the relations of the filters are largely ignored. The filters usually work jointly to make an accurate prediction in a collaborative way. Similar filters will have equivalent effects on the network prediction, and the redundant filters can be further pruned. Second, the pruning criterion remains unchanged during training. As the network updated at each iteration, the filter distribution also changes continuously. The pruning criterions should also be adaptively switched. In this paper, we propose Meta Filter Pruning (MFP) to solve the above problems. First, as a complement to the existing p-norm criterion, we introduce a new pruning criterion considering the filter relation via filter distance. Additionally, we build a meta pruning framework for filter pruning, so that our method could adaptively select the most appropriate pruning criterion as the filter distribution changes. Experiments validate our approach on two image classification benchmarks. Notably, on ILSVRC-2012, our MFP reduces more than 50% FLOPs on ResNet-50 with only 0.44% top-5 accuracy loss.

Includes members:
  Member "exploring linear relationship in feature map subspace for convnets compression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "filter grafting for deep neural networks")
  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 "rethinking the smaller norm less informative assumption in channel pruning of convolution layers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "leveraging filter correlations for deep model compression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a network pruning network approach to deep model compression")
  Member "discrimination aware channel pruning for deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "a systematic dnn weight pruning framework using alternating direction method of multipliers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "patdnn achieving real time dnn execution on mobile devices with pattern based weight pruning")
  Member "scsp spectral clustering filter pruning with soft self adaption manners":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "filter grafting for deep neural networks")
  Member "network compression using correlation analysis of layer responses":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "least squares binary quantization of neural networks")

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.CV(Computer Vision and Pattern Recognition)