human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "minimal effort back propagation for convolutional neural networks"
  Abstract: As traditional neural network consumes a significant amount of computing resources during back propagation, \citet{Sun2017mePropSB} propose a simple yet effective technique to alleviate this problem. In this technique, only a small subset of the full gradients are computed to update the model parameters. In this paper we extend this technique into the Convolutional Neural Network(CNN) to reduce calculation in back propagation, and the surprising results verify its validity in CNN: only 5\% of the gradients are passed back but the model still achieves the same effect as the traditional CNN, or even better. We also show that the top-$k$ selection of gradients leads to a sparse calculation in back propagation, which may bring significant computational benefits for high computational complexity of convolution operation in CNN.

Connected through hyperedge HE-1 (induced by source paper "sparse weight activation training"):
  with members:
    - "improving neural network quantization without retraining using outlier channel splitting"
    - "swalp stochastic weight averaging in low precision training"
    - "scalable methods for 8 bit training of neural networks"
    - "mixed precision training of convolutional neural networks using integer operations"
    - "bridging the accuracy gap for 2 bit quantized neural networks qnn"
    - "training and inference with integers in deep neural networks"
    - "high accuracy low precision training"
    - "per tensor fixed point quantization of the back propagation algorithm"

Connected through hyperedge HE-2 (induced by source paper "accelerated cnn training through gradient approximation"):
  with members:
    - "training simplification and model simplification for deep learning a minimal effort back propagation method"
    - "prunetrain gradual structured pruning from scratch for faster neural network training"
    - "prunetrain fast neural network training by dynamic sparse model reconfiguration"
    - "biologically plausible learning algorithms can scale to large datasets"
    - "nvidia tensor core programmability performance precision"
    - "faster neural network training with approximate tensor operations"
    - "sbnet sparse blocks network for fast inference"
    - "dropback continuous pruning during training"

Connected through hyperedge HE-3 (induced by source paper "memorized sparse backpropagation"):
  with members:
    - "training simplification and model simplification for deep learning a minimal effort back propagation method"
    - "sparsified sgd with memory"
    - "meprop sparsified back propagation for accelerated deep learning with reduced overfitting"
    - "identity mappings in deep residual networks"
    - "bidirectional lstm crf models for sequence tagging"
    - "adam a method for stochastic optimization"
    - "fractional max pooling"
    - "convolutional neural networks for sentence classification"

Connected through hyperedge HE-4 (induced by source paper "automatic academic paper rating based on modularized hierarchical convolutional neural network"):
  with members:
    - "automatic text scoring using neural networks"
    - "adam a method for stochastic optimization"
    - "natural language processing almost from scratch"

Question: Please tell me which class the center node 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)