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 "adaptive online planning for continual lifelong learning"):
  Abstract: We study learning control in an online lifelong learning scenario, where mistakes can compound catastrophically into the future and the underlying dynamics of the environment may change. Traditional model-free policy learning methods have achieved successes in difficult tasks due to their broad flexibility, and capably condense broad experiences into compact networks, but struggle in this setting, as they can activate failure modes early in their lifetimes which are difficult to recover from and face performance degradation as dynamics change. On the other hand, model-based planning methods learn and adapt quickly, but require prohibitive levels of computational resources. Under constrained computation limits, the agent must allocate its resources wisely, which requires the agent to understand both its own performance and the current state of the environment: knowing that its mastery over control in the current dynamics is poor, the agent should dedicate more time to planning. We present a new algorithm, Adaptive Online Planning (AOP), that achieves strong performance in this setting by combining model-based planning with model-free learning. By measuring the performance of the planner and the uncertainty of the model-free components, AOP is able to call upon more extensive planning only when necessary, leading to reduced computation times. We show that AOP gracefully deals with novel situations, adapting behaviors and policies effectively in the face of unpredictable changes in the world -- challenges that a continual learning agent naturally faces over an extended lifetime -- even when traditional reinforcement learning methods fail.

Includes members:
  Member "exploring model based planning with policy networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "objective mismatch in model based reinforcement learning")
  Member "continual lifelong learning with neural networks a review":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "when to trust your model model based policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to walk in the real world with minimal human effort")
  Member "model ensemble trust region policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ready policy one world building through active learning")
  Member "off policy deep reinforcement learning without exploration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scaling data driven robotics with reward sketching and batch reinforcement learning")
  Member "learning to search with mctsnets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a review of tracking prediction and decision making methods for autonomous driving")
  Member "sample efficient reinforcement learning with stochastic ensemble value expansion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "can increasing input dimensionality improve deep reinforcement learning")
  Member "reinforcement and imitation learning for diverse visuomotor skills":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scaling data driven robotics with reward sketching and batch 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)