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 "algorithmic framework for model based deep reinforcement learning with theoretical guarantees"):
  Abstract: Model-based reinforcement learning (RL) is considered to be a promising approach to reduce the sample complexity that hinders model-free RL. However, the theoretical understanding of such methods has been rather limited. This paper introduces a novel algorithmic framework for designing and analyzing model-based RL algorithms with theoretical guarantees. We design a meta-algorithm with a theoretical guarantee of monotone improvement to a local maximum of the expected reward. The meta-algorithm iteratively builds a lower bound of the expected reward based on the estimated dynamical model and sample trajectories, and then maximizes the lower bound jointly over the policy and the model. The framework extends the optimism-in-face-of-uncertainty principle to non-linear dynamical models in a way that requires \textit{no explicit} uncertainty quantification. Instantiating our framework with simplification gives a variant of model-based RL algorithms Stochastic Lower Bounds Optimization (SLBO). Experiments demonstrate that SLBO achieves state-of-the-art performance when only one million or fewer samples are permitted on a range of continuous control benchmark tasks.

Includes members:
  Member "universal planning networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")
  Member "temporal difference models model free deep rl for model based control":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement")
  Member "dual policy iteration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning self correctable policies and value functions from demonstrations with negative sampling")
  Member "simple random search provides a competitive approach to reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "model ensemble trust region policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ready policy one world building through active learning")
  Member "zero shot visual imitation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "universal value density estimation for imitation learning and goal conditioned reinforcement learning")
  Member "graph networks as learnable physics engines for inference and control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "benchmarking graph neural networks")
  Member "sample efficient reinforcement learning with stochastic ensemble value expansion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "can increasing input dimensionality improve deep reinforcement 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)