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 "per tensor fixed point quantization of the back propagation algorithm"):
  Abstract: The high computational and parameter complexity of neural networks makes their training very slow and difficult to deploy on energy and storage-constrained computing systems. Many network complexity reduction techniques have been proposed including fixed-point implementation. However, a systematic approach for designing full fixed-point training and inference of deep neural networks remains elusive. We describe a precision assignment methodology for neural network training in which all network parameters, i.e., activations and weights in the feedforward path, gradients and weight accumulators in the feedback path, are assigned close to minimal precision. The precision assignment is derived analytically and enables tracking the convergence behavior of the full precision training, known to converge a priori. Thus, our work leads to a systematic methodology of determining suitable precision for fixed-point training. The near optimality (minimality) of the resulting precision assignment is validated empirically for four networks on the CIFAR-10, CIFAR-100, and SVHN datasets. The complexity reduction arising from our approach is compared with other fixed-point neural network designs.

Includes members:
  Member "training and inference with integers in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sparse weight activation training")
  Member "deep k means re training and parameter sharing with harder cluster assignments for compressing deep convolutions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "triple wins boosting accuracy robustness and efficiency together by enabling input adaptive inference")
  Member "the high dimensional geometry of binary neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparse weight activation training")
  Member "the shattered gradients problem if resnets are the answer then what is the question":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "regularizing activations in neural networks via distribution matching with the wasserstein metric")
  Member "terngrad ternary gradients to reduce communication in distributed deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication optimization strategies for distributed deep learning a survey")
  Member "flexpoint an adaptive numerical format for efficient training of deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "shifted and squeezed 8 bit floating point format for low precision training of deep neural networks")
  Member "accurate large minibatch sgd training imagenet in 1 hour":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning representations by predicting bags of visual words")
  Member "dorefa net training low bitwidth convolutional neural networks with low bitwidth gradients":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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)