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 "autoshufflenet learning permutation matrices via an exact lipschitz continuous penalty in deep convolutional neural networks"):
  Abstract: ShuffleNet is a state-of-the-art light weight convolutional neural network architecture. Its basic operations include group, channel-wise convolution and channel shuffling. However, channel shuffling is manually designed empirically. Mathematically, shuffling is a multiplication by a permutation matrix. In this paper, we propose to automate channel shuffling by learning permutation matrices in network training. We introduce an exact Lipschitz continuous non-convex penalty so that it can be incorporated in the stochastic gradient descent to approximate permutation at high precision. Exact permutations are obtained by simple rounding at the end of training and are used in inference. The resulting network, referred to as AutoShuffleNet, achieved improved classification accuracies on CIFAR-10 and ImageNet data sets. In addition, we found experimentally that the standard convex relaxation of permutation matrices into stochastic matrices leads to poor performance. We prove theoretically the exactness (error bounds) in recovering permutation matrices when our penalty function is zero (very small). We present examples of permutation optimization through graph matching and two-layer neural network models where the loss functions are calculated in closed analytical form. In the examples, convex relaxation failed to capture permutations whereas our penalty succeeded.

Includes members:
  Member "igcv3 interleaved low rank group convolutions for efficient deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "xsepconv extremely separated convolution")
  Member "shufflenet v2 practical guidelines for efficient cnn architecture design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "post training piecewise linear quantization for deep neural networks")
  Member "shufflenet an extremely efficient convolutional neural network for mobile devices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "post training piecewise linear quantization for deep neural networks")
  Member "much faster algorithms for matrix scaling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "flows in almost linear time via adaptive preconditioning")
  Member "convergence analysis of two layer neural networks with relu activation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "backward feature correction how deep learning performs deep learning")
  Member "a path following algorithm for the graph matching problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep graph matching consensus")

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)