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 "network learning with local propagation"):
  Abstract: This paper presents a locally decoupled network parameter learning with local propagation. Three elements are taken into account: (i) sets of nonlinear transforms that describe the representations at all nodes, (ii) a local objective at each node related to the corresponding local representation goal, and (iii) a local propagation model that relates the nonlinear error vectors at each node with the goal error vectors from the directly connected nodes. The modeling concepts (i), (ii) and (iii) offer several advantages, including (a) a unified learning principle for any network that is represented as a graph, (b) understanding and interpretation of the local and the global learning dynamics, (c) decoupled and parallel parameter learning, (d) a possibility for learning in infinitely long, multi-path and multi-goal networks. Numerical experiments validate the potential of the learning principle. The preliminary results show advantages in comparison to the state-of-the-art methods, w.r.t. the learning time and the network size while having comparable recognition accuracy.

Includes members:
  Member "understanding synthetic gradients and decoupled neural interfaces":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decoupled greedy learning of cnns")
  Member "sgdr stochastic gradient descent with restarts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "decoupled neural interfaces using synthetic gradients":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sideways depth parallel training of video models")
  Member "training neural networks without gradients a scalable admm approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep connections between learning from limited labels physical parameter estimation inspiration for regularization")
  Member "an overview of gradient descent optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "a critical review of recurrent neural networks for sequence learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ten social dimensions of conversations and relationships")
  Member "deep learning in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "π nets deep polynomial neural networks")
  Member "deep residual learning for image recognition":
    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)