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 "learn a prior for rhea for better online planning"):
  Abstract: Rolling Horizon Evolutionary Algorithms (RHEA) are a class of online planning methods for real-time game playing; their performance is closely related to the planning horizon and the search time allowed. In this paper, we propose to learn a prior for RHEA in an offline manner by training a value network and a policy network. The value network is used to reduce the planning horizon by providing an estimation of future rewards, and the policy network is used to initialize the population, which helps to narrow down the search scope. The proposed algorithm, named prior-based RHEA (p-RHEA), trains policy and value networks by performing planning and learning iteratively. In the planning stage, the horizon-limited search assisted with the policy network and value network is performed to improve the policies and collect training samples. In the learning stage, the policy network and value network are trained with the collected samples to learn better prior knowledge. Experimental results on OpenAI Gym MuJoCo tasks show that the performance of the proposed p-RHEA is significantly improved compared to that of RHEA.

Includes members:
  Member "cem rl combining evolutionary and gradient based methods for policy search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "evolution guided policy gradient in reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "plan online learn offline efficient learning and exploration via model based control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "neural lyapunov model predictive control")
  Member "proximal policy optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "benchmarking deep reinforcement learning for continuous control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "the cma evolution strategy a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hyper parameter optimization a review of algorithms and applications")
  Member "trust region policy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep reinforcement learning for autonomous driving a survey")

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.AI(Artificial Intelligence)