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 "reverse curriculum generation for reinforcement learning"):
  Abstract: Many relevant tasks require an agent to reach a certain state, or to manipulate objects into a desired configuration. For example, we might want a robot to align and assemble a gear onto an axle or insert and turn a key in a lock. These goal-oriented tasks present a considerable challenge for reinforcement learning, since their natural reward function is sparse and prohibitive amounts of exploration are required to reach the goal and receive some learning signal. Past approaches tackle these problems by exploiting expert demonstrations or by manually designing a task-specific reward shaping function to guide the learning agent. Instead, we propose a method to learn these tasks without requiring any prior knowledge other than obtaining a single state in which the task is achieved. The robot is trained in reverse, gradually learning to reach the goal from a set of start states increasingly far from the goal. Our method automatically generates a curriculum of start states that adapts to the agent's performance, leading to efficient training on goal-oriented tasks. We demonstrate our approach on difficult simulated navigation and fine-grained manipulation problems, not solvable by state-of-the-art reinforcement learning methods.

Includes members:
  Member "automated curriculum learning for neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi source domain adaptation for text classification via distancenet bandits")
  Member "automatic goal generation for reinforcement learning agents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "meta learning curiosity algorithms")
  Member "domain randomization for transferring deep neural networks from simulation to the real world":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "intrinsic motivation and automatic curricula via asymmetric self play":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "towards generalization and simplicity in continuous control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ride rewarding impact driven exploration for procedurally generated environments")
  Member "benchmarking deep reinforcement learning for continuous control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "high dimensional continuous control using generalized advantage estimation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "artificial intelligence for prosthetics challenge solutions")
  Member "continuous control with deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)