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 "neural networks with few multiplications"):
  Abstract: For most deep learning algorithms training is notoriously time consuming. Since most of the computation in training neural networks is typically spent on floating point multiplications, we investigate an approach to training that eliminates the need for most of these. Our method consists of two parts: First we stochastically binarize weights to convert multiplications involved in computing hidden states to sign changes. Second, while back-propagating error derivatives, in addition to binarizing the weights, we quantize the representations at each layer to convert the remaining multiplications into binary shifts. Experimental results across 3 popular datasets (MNIST, CIFAR10, SVHN) show that this approach not only does not hurt classification performance but can result in even better performance than standard stochastic gradient descent training, paving the way to fast, hardware-friendly training of neural networks.

Includes members:
  Member "bitwise neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "autoq automated kernel wise neural network quantization")
  Member "binaryconnect training deep neural networks with binary weights during propagations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse weight activation training")
  Member "computational cost reduction in learned transform classifications":
    also connected through other hyperedges:
      (none)
  Member "training binary multilayer neural networks for image classification using expectation backpropagation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recent advances in efficient computation of deep convolutional neural networks")
  Member "on using monolingual corpora in neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cued wmt19 ewc lms")
  Member "building high level features using large scale unsupervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "certified robustness to label flipping attacks via randomized smoothing")

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)