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 "meta learning with warped gradient descent"):
  Abstract: A versatile and effective approach to meta-learning is to infer a gradient-based up-date rule directly from data that promotes rapid learning of new tasks from the same distribution. Current methods rely on backpropagating through the learning process, limiting their scope to few-shot learning. In this work, we introduce Warped Gradient Descent (WarpGrad), a family of modular optimisers that can scale to arbitrary adaptation processes. WarpGrad methods meta-learn to warp task loss surfaces across the joint task-parameter distribution to facilitate gradient descent, which is achieved by a reparametrisation of neural networks that interleaves warp layers in the architecture. These layers are shared across task learners and fixed during adaptation; they represent a projection of task parameters into a meta-learned space that is conducive to task adaptation and standard backpropagation induces a form of gradient preconditioning. WarpGrad methods are computationally efficient and easy to implement as they rely on parameter sharing and backpropagation. They are readily combined with other meta-learners and can scale both in terms of model size and length of adaptation trajectories as meta-learning warp parameters do not require differentiation through task adaptation processes. We show empirically that WarpGrad optimisers meta-learn a warped space where gradient descent is well behaved, with faster convergence and better performance in a variety of settings, including few-shot, standard supervised, continual, and reinforcement learning.

Includes members:
  Member "backpropamine training self modifying neural networks with differentiable neuromodulated plasticity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding online neural update rules by learning to remember")
  Member "guided meta policy search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "provably convergent policy gradient methods for model agnostic meta reinforcement learning")
  Member "meta learning with differentiable convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cross domain few shot classification via learned feature wise transformation")
  Member "efficient off policy meta reinforcement learning via probabilistic context variables":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rapidly adaptable legged robots via evolutionary meta learning")
  Member "meta learning representations for continual learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "on first order meta learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "understanding short horizon bias in stochastic meta optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "recasting gradient based meta learning as hierarchical bayes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "is the meta learning idea able to improve the generalization of deep neural networks on the standard supervised learning")

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)