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: "convolutional neural networks with low rank regularization"
  Abstract: Large CNNs have delivered impressive performance in various computer vision applications. But the storage and computation requirements make it problematic for deploying these models on mobile devices. Recently, tensor decompositions have been used for speeding up CNNs. In this paper, we further develop the tensor decomposition technique. We propose a new algorithm for computing the low-rank tensor decomposition for removing the redundancy in the convolution kernels. The algorithm finds the exact global optimizer of the decomposition and is more effective than iterative methods. Based on the decomposition, we further propose a new method for training low-rank constrained CNNs from scratch. Interestingly, while achieving a significant speedup, sometimes the low-rank constrained CNNs delivers significantly better performance than their non-constrained counterparts. On the CIFAR-10 dataset, the proposed low-rank NIN model achieves $91.31\%$ accuracy (without data augmentation), which also improves upon state-of-the-art result. We evaluated the proposed method on CIFAR-10 and ILSVRC12 datasets for a variety of modern CNNs, including AlexNet, NIN, VGG and GoogleNet with success. For example, the forward time of VGG-16 is reduced by half while the performance is still comparable. Empirical success suggests that low-rank tensor decompositions can be a very useful tool for speeding up large CNNs.

Connected through hyperedge HE-1 (induced by source paper "discrimination aware network pruning for deep model compression"):
  with members:
    - "hierarchical binary cnns for landmark localization with limited resources"
    - "towards optimal structured cnn pruning via generative adversarial learning"
    - "gate decorator global filter pruning method for accelerating deep convolutional neural networks"
    - "auto embedding generative adversarial networks for high resolution image synthesis"
    - "importance estimation for neural network pruning"
    - "nat neural architecture transformer for accurate and compact architectures"
    - "efficientnet rethinking model scaling for convolutional neural networks"
    - "pytorch an imperative style high performance deep learning library"

Connected through hyperedge HE-2 (induced by source paper "progressive gradient pruning for classification detection and domainadaptation"):
  with members:
    - "importance estimation for neural network pruning"
    - "filter pruning via geometric median for deep convolutional neural networks acceleration"
    - "structured pruning of neural networks with budget aware regularization"
    - "yolov3 an incremental improvement"
    - "sbnet sparse blocks network for fast inference"
    - "discrimination aware channel pruning for deep neural networks"
    - "syq learning symmetric quantization for efficient deep neural networks"
    - "a systematic dnn weight pruning framework using alternating direction method of multipliers"

Connected through hyperedge HE-3 (induced by source paper "a privacy preserving dnn pruning and mobile acceleration framework"):
  with members:
    - "asymptotic soft filter pruning for deep convolutional neural networks"
    - "pconv the missing but desirable sparsity in dnn weight pruning for real time execution on mobile devices"
    - "data free learning of student networks"
    - "2pfpce two phase filter pruning based on conditional entropy"
    - "amc automl for model compression and acceleration on mobile devices"
    - "private model compression via knowledge distillation"
    - "discrimination aware channel pruning for deep neural networks"
    - "a systematic dnn weight pruning framework using alternating direction method of multipliers"

Connected through hyperedge HE-4 (induced by source paper "effective training of convolutional neural networks with low bitwidth weights and activations"):
  with members:
    - "knowledge adaptation for efficient semantic segmentation"
    - "single path one shot neural architecture search with uniform sampling"
    - "precision highway for ultra low precision quantization"
    - "amc automl for model compression and acceleration on mobile devices"
    - "bi real net enhancing the performance of 1 bit cnns with improved representational capability and advanced training algorithm"
    - "lq nets learned quantization for highly accurate and compact deep neural networks"
    - "learning to quantize deep networks by optimizing quantization intervals with task loss"
    - "proxylessnas direct neural architecture search on target task and hardware"

Connected through hyperedge HE-5 (induced by source paper "towards compact convnets via structure sparsity regularized filter pruning"):
  with members:
    - "mobilenetv2 inverted residuals and linear bottlenecks"
    - "attention based guided structured sparsity of deep neural networks"
    - "soft filter pruning for accelerating deep convolutional neural networks"
    - "shufflenet an extremely efficient convolutional neural network for mobile devices"
    - "learning efficient convolutional networks through network slimming"
    - "mobilenets efficient convolutional neural networks for mobile vision applications"
    - "thinet a filter level pruning method for deep neural network compression"
    - "squeezenet alexnet level accuracy with 50x fewer parameters and 0 5mb model size"

Connected through hyperedge HE-6 (induced by source paper "efficient differentiable neural architecture search with meta kernels"):
  with members:
    - "res2net a new multi scale backbone architecture"
    - "autogan neural architecture search for generative adversarial networks"
    - "single path nas designing hardware efficient convnets in less than 4 hours"
    - "searching for a robust neural architecture in four gpu hours"
    - "detnas backbone search for object detection"
    - "exploring randomly wired neural networks for image recognition"
    - "densely connected search space for more flexible neural architecture search"
    - "searching for mobilenetv3"

Connected through hyperedge HE-7 (induced by source paper "branched multi task networks deciding what layers to share"):
  with members:
    - "stochastic filter groups for multi task cnns learning specialist and generalist convolution kernels"
    - "representation similarity analysis for efficient task taxonomy transfer learning"
    - "feature partitioning for efficient multi task architectures"
    - "attentive single tasking of multiple tasks"
    - "a modulation module for multi task learning with applications in image retrieval"
    - "evolutionary architecture search for deep multitask networks"
    - "regularized evolution for image classifier architecture search"
    - "taskonomy disentangling task transfer learning"

Connected through hyperedge HE-8 (induced by source paper "adversarially trained model compression when robustness meets efficiency"):
  with members:
    - "learning sparsity and quantization jointly and automatically for neural network compression via constrained optimization"
    - "adversarial robustness may be at odds with simplicity"
    - "defensive quantization when efficiency meets robustness"
    - "dual dynamic inference enabling more efficient adaptive and controllable deep inference"
    - "towards imperceptible and robust adversarial example attacks against neural networks"
    - "mobilenetv2 inverted residuals and linear bottlenecks"
    - "sparse dnns with improved adversarial robustness"
    - "stochastic activation pruning for robust adversarial defense"

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.LG(Machine Learning)