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 "least squares binary quantization of neural networks"):
  Abstract: Quantizing weights and activations of deep neural networks results in significant improvement in inference efficiency at the cost of lower accuracy. A source of the accuracy gap between full precision and quantized models is the quantization error. In this work, we focus on the binary quantization, in which values are mapped to -1 and 1. We introduce several novel quantization algorithms: optimal 1-bit, ternary, 2-bits, and greedy. Our quantization algorithms can be implemented efficiently on the hardware using bitwise operations. We present proofs to show that our proposed methods are optimal, and also provide empirical error analysis. We conduct experiments on the ImageNet dataset and show a reduced accuracy gap when using the proposed optimal quantization algorithms.

Includes members:
  Member "drop an octave reducing spatial redundancy in convolutional neural networks with octave convolution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "searching for winograd aware quantized networks")
  Member "efficientnet rethinking model scaling for convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "espnet efficient spatial pyramid of dilated convolutions for semantic segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "real time high performance semantic image segmentation of urban street scenes")
  Member "mobilenetv2 inverted residuals and linear bottlenecks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "bridging the accuracy gap for 2 bit quantized neural networks qnn":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sparse weight activation training")
  Member "espnetv2 a light weight power efficient and general purpose convolutional neural network":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "highly efficient salient object detection with 100k parameters")
  Member "lq nets learned quantization for highly accurate and compact deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sparse weight activation training")
  Member "shufflenet v2 practical guidelines for efficient cnn architecture design":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "post training piecewise linear quantization for deep 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.LG(Machine Learning)