human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "towards compact convnets via structure sparsity regularized filter pruning"
  Abstract: The success of convolutional neural networks (CNNs) in computer vision applications has been accompanied by a significant increase of computation and memory costs, which prohibits its usage on resource-limited environments such as mobile or embedded devices. To this end, the research of CNN compression has recently become emerging. In this paper, we propose a novel filter pruning scheme, termed structured sparsity regularization (SSR), to simultaneously speedup the computation and reduce the memory overhead of CNNs, which can be well supported by various off-the-shelf deep learning libraries. Concretely, the proposed scheme incorporates two different regularizers of structured sparsity into the original objective function of filter pruning, which fully coordinates the global outputs and local pruning operations to adaptively prune filters. We further propose an Alternative Updating with Lagrange Multipliers (AULM) scheme to efficiently solve its optimization. AULM follows the principle of ADMM and alternates between promoting the structured sparsity of CNNs and optimizing the recognition loss, which leads to a very efficient solver (2.5x to the most recent work that directly solves the group sparsity-based regularization). Moreover, by imposing the structured sparsity, the online inference is extremely memory-light, since the number of filters and the output feature maps are simultaneously reduced. The proposed scheme has been deployed to a variety of state-of-the-art CNN structures including LeNet, AlexNet, VGG, ResNet and GoogLeNet over different datasets. Quantitative results demonstrate that the proposed scheme achieves superior performance over the state-of-the-art methods. We further demonstrate the proposed compression scheme for the task of transfer learning, including domain adaptation and object detection, which also show exciting performance gains over the state-of-the-arts.

Connected through hyperedge HE-1 (induced by source paper "towards optimal structured cnn pruning via generative adversarial learning"):
  with members:
    - "filter pruning via geometric median for deep convolutional neural networks acceleration"
    - "amc automl for model compression and acceleration on mobile devices"
    - "rethinking the smaller norm less informative assumption in channel pruning of convolution layers"
    - "discrimination aware channel pruning for deep neural networks"
    - "shufflenet an extremely efficient convolutional neural network for mobile devices"
    - "learning efficient convolutional networks through network slimming"
    - "nisp pruning networks using neuron importance score propagation"
    - "data driven sparse structure selection for deep neural networks"

Connected through hyperedge HE-2 (induced by source paper "centripetal sgd for pruning very deep convolutional networks with complicated structure"):
  with members:
    - "autopruner an end to end trainable filter pruning method for efficient deep model inference"
    - "leveraging filter correlations for deep model compression"
    - "discrimination aware channel pruning for deep neural networks"
    - "a systematic dnn weight pruning framework using alternating direction method of multipliers"
    - "structured pruning for efficient convnets via incremental regularization"
    - "soft filter pruning for accelerating deep convolutional neural networks"
    - "rethinking the value of network pruning"
    - "learning efficient convolutional networks through network slimming"

Connected through hyperedge HE-3 (induced by source paper "global sparse momentum sgd for pruning very deep neural networks"):
  with members:
    - "metapruning meta learning for automatic neural network channel pruning"
    - "approximated oracle filter pruning for destructive cnn width optimization"
    - "centripetal sgd for pruning very deep convolutional networks with complicated structure"
    - "faster gaze prediction with dense networks and fisher pruning"
    - "bi real net enhancing the performance of 1 bit cnns with improved representational capability and advanced training algorithm"
    - "the lottery ticket hypothesis finding sparse trainable neural networks"
    - "a systematic dnn weight pruning framework using alternating direction method of multipliers"
    - "structured pruning for efficient convnets via incremental regularization"

Connected through hyperedge HE-4 (induced by source paper "filter early match late improving network based visual place recognition"):
  with members:
    - "multi process fusion visual place recognition using multiple image processing methods"
    - "don t look back robustifying place categorization for viewpoint and condition invariant place recognition"
    - "lost appearance invariant place recognition for opposite viewpoints using visual semantics"
    - "feature map filtering improving visual place recognition with convolutional calibration"
    - "deep learning features at scale for visual place recognition"
    - "refinenet multi path refinement networks for high resolution semantic segmentation"
    - "large scale image retrieval with attentive deep local features"
    - "pruning filters for efficient convnets"

Question: Please tell me which class the center node 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)