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 "promp proximal meta policy search"):
  Abstract: Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during meta-training as well as ineffective task identification strategies. This paper provides a theoretical analysis of credit assignment in gradient-based Meta-RL. Building on the gained insights we develop a novel meta-learning algorithm that overcomes both the issue of poor credit assignment and previous difficulties in estimating meta-policy gradients. By controlling the statistical distance of both pre-adaptation and adapted policies during meta-policy search, the proposed algorithm endows efficient and stable meta-learning. Our approach leads to superior pre-adaptation policy behavior and consistently outperforms previous Meta-RL algorithms in sample-efficiency, wall-clock time, and asymptotic performance.

Includes members:
  Member "some considerations on learning to explore via meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "meta learning curiosity algorithms")
  Member "on first order meta learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "modular meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "meta learning curiosity algorithms")
  Member "differentiable plasticity training plastic neural networks with backpropagation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "neuroevolution of self interpretable agents")
  Member "meta reinforcement learning of structured exploration strategies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "meta learning curiosity algorithms")
  Member "model based reinforcement learning via meta policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ready policy one world building through active learning")
  Member "meta learning shared hierarchies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "revisiting meta learning as supervised learning")
  Member "constrained policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust deep reinforcement learning against adversarial perturbations on observations")

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)