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 "intrinsically motivated goal exploration processes with automatic curriculum learning"):
  Abstract: Intrinsically motivated spontaneous exploration is a key enabler of autonomous lifelong learning in human children. It allows them to discover and acquire large repertoires of skills through self-generation, self-selection, self-ordering and self-experimentation of learning goals. We present the unsupervised multi-goal reinforcement learning formal framework as well as an algorithmic approach called intrinsically motivated goal exploration processes (IMGEP) to enable similar properties of autonomous learning in machines. The IMGEP algorithmic architecture relies on several principles: 1) self-generation of goals as parameterized reinforcement learning problems; 2) selection of goals based on intrinsic rewards; 3) exploration with parameterized time-bounded policies and fast incremental goal-parameterized policy search; 4) systematic reuse of information acquired when targeting a goal for improving other goals. We present a particularly efficient form of IMGEP that uses a modular representation of goal spaces as well as intrinsic rewards based on learning progress. We show how IMGEPs automatically generate a learning curriculum within an experimental setup where a real humanoid robot can explore multiple spaces of goals with several hundred continuous dimensions. While no particular target goal is provided to the system beforehand, this curriculum allows the discovery of skills of increasing complexity, that act as stepping stone for learning more complex skills (like nested tool use). We show that learning several spaces of diverse problems can be more efficient for learning complex skills than only trying to directly learn these complex skills. We illustrate the computational efficiency of IMGEPs as these robotic experiments use a simple memory-based low-level policy representations and search algorithm, enabling the whole system to learn online and incrementally on a Raspberry Pi 3.

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 "teacher student curriculum learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automatic curriculum learning for deep rl a short survey")
  Member "curiosity driven exploration by self supervised prediction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "reinforcement learning with unsupervised auxiliary tasks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perception and decision making of autonomous systems in the era of learning an overview")
  Member "hierarchical deep reinforcement learning integrating temporal abstraction and intrinsic motivation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "variational intrinsic control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "vime variational information maximizing exploration":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "unifying count based exploration and intrinsic motivation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")

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)