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 "model based stabilisation of deep reinforcement learning"):
  Abstract: Though successful in high-dimensional domains, deep reinforcement learning exhibits high sample complexity and suffers from stability issues as reported by researchers and practitioners in the field. These problems hinder the application of such algorithms in real-world and safety-critical scenarios. In this paper, we take steps towards stable and efficient reinforcement learning by following a model-based approach that is known to reduce agent-environment interactions. Namely, our method augments deep Q-networks (DQNs) with model predictions for transitions, rewards, and termination flags. #R##N#Having the model at hand, we then conduct a rigorous theoretical study of our algorithm and show, for the first time, convergence to a stationary point. En route, we provide a counter-example showing that 'vanilla' DQNs can diverge confirming practitioners' and researchers' experiences. Our proof is novel in its own right and can be extended to other forms of deep reinforcement learning. In particular, we believe exploiting the relation between reinforcement (with deep function approximators) and online learning can serve as a recipe for future proofs in the domain. Finally, we validate our theoretical results in 20 games from the Atari benchmark. Our results show that following the proposed model-based learning approach not only ensures convergence but leads to a reduction in sample complexity and superior performance.

Includes members:
  Member "temporal difference models model free deep rl for model based control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement")
  Member "deep reinforcement learning with model learning and monte carlo tree search in minecraft":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "why build an assistant in minecraft")
  Member "learning and querying fast generative models for reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relational state space model for stochastic multi object systems")
  Member "rainbow combining improvements in deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "value prediction network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "plannable approximations to mdp homomorphisms equivariance under actions")
  Member "recurrent environment simulators":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "curiosity driven exploration by self supervised prediction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "a deep learning approach for joint video frame and reward prediction in atari games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "disentangling controllable object through video prediction improves visual 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)