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 "towards unified int8 training for convolutional neural network"):
  Abstract: Recently low-bit (e.g., 8-bit) network quantization has been extensively studied to accelerate the inference. Besides inference, low-bit training with quantized gradients can further bring more considerable acceleration, since the backward process is often computation-intensive. Unfortunately, the inappropriate quantization of backward propagation usually makes the training unstable and even crash. There lacks a successful unified low-bit training framework that can support diverse networks on various tasks. In this paper, we give an attempt to build a unified 8-bit (INT8) training framework for common convolutional neural networks from the aspects of both accuracy and speed. First, we empirically find the four distinctive characteristics of gradients, which provide us insightful clues for gradient quantization. Then, we theoretically give an in-depth analysis of the convergence bound and derive two principles for stable INT8 training. Finally, we propose two universal techniques, including Direction Sensitive Gradient Clipping that reduces the direction deviation of gradients and Deviation Counteractive Learning Rate Scaling that avoids illegal gradient update along the wrong direction. The experiments show that our unified solution promises accurate and efficient INT8 training for a variety of networks and tasks, including MobileNetV2, InceptionV3 and object detection that prior studies have never succeeded. Moreover, it enjoys a strong flexibility to run on off-the-shelf hardware, and reduces the training time by 22% on Pascal GPU without too much optimization effort. We believe that this pioneering study will help lead the community towards a fully unified INT8 training for convolutional neural networks.

Includes members:
  Member "regularizing activation distribution for training binarized deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "adaptive gradient methods with dynamic bound of learning rate":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a metric learning reality check")
  Member "differentiable soft quantization bridging full precision and low bit neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "searching for winograd aware quantized networks")
  Member "on the convergence of adam and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "training high performance and large scale deep neural networks with full 8 bit integers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "drawing early bird tickets towards more efficient training of deep networks")
  Member "learned step size quantization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ordering chaos memory aware scheduling of irregularly wired neural networks for edge devices")
  Member "mixed precision training of convolutional neural networks using integer operations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sparse weight activation training")
  Member "quantizing deep convolutional networks for efficient inference a whitepaper":
    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)