human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "active learning of inverse models with intrinsically motivated goal exploration in robots"
  Abstract: We introduce the Self-Adaptive Goal Generation Robust Intelligent Adaptive Curiosity (SAGG-RIAC) architecture as an intrinsically motivated goal exploration mechanism which allows active learning of inverse models in high-dimensional redundant robots. This allows a robot to efficiently and actively learn distributions of parameterized motor skills/policies that solve a corresponding distribution of parameterized tasks/goals. The architecture makes the robot sample actively novel parameterized tasks in the task space, based on a measure of competence progress, each of which triggers low-level goal-directed learning of the motor policy parameters that allow to solve it. For both learning and generalization, the system leverages regression techniques which allow to infer the motor policy parameters corresponding to a given novel parameterized task, and based on the previously learnt correspondences between policy and task parameters. We present experiments with high-dimensional continuous sensorimotor spaces in three different robotic setups: (1) learning the inverse kinematics in a highly-redundant robotic arm, (2) learning omnidirectional locomotion with motor primitives in a quadruped robot, and (3) an arm learning to control a fishing rod with a flexible wire. We show that (1) exploration in the task space can be a lot faster than exploration in the actuator space for learning inverse models in redundant robots; (2) selecting goals maximizing competence progress creates developmental trajectories driving the robot to progressively focus on tasks of increasing complexity and is statistically significantly more efficient than selecting tasks randomly, as well as more efficient than different standard active motor babbling methods; (3) this architecture allows the robot to actively discover which parts of its task space it can learn to reach and which part it cannot.

Connected through hyperedge HE-1 (induced by source paper "scaling map elites to deep neuroevolution"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "adversarial policies attacking deep reinforcement learning"
    - "mulex disentangling exploitation from exploration in deep rl"
    - "covariance matrix adaptation for the rapid illumination of behavior space"
    - "scheduled intrinsic drive a hierarchical take on intrinsically motivated exploration"
    - "evolvability es scalable and direct optimization of evolvability"
    - "teacher algorithms for curriculum learning of deep rl in continuously parameterized environments"
    - "reset free trial and error learning for robot damage recovery"

Connected through hyperedge HE-2 (induced by source paper "curriculum learning for reinforcement learning domains a framework and survey"):
  with members:
    - "emergent tool use from multi agent autocurricula"
    - "an optimization framework for task sequencing in curriculum learning"
    - "curriculum learning for cumulative return maximization"
    - "evolutionarily curated curriculum learning for deep reinforcement learning agents"
    - "starcraft micromanagement with reinforcement learning and curriculum transfer learning"
    - "curriculum learning by transfer learning theory and experiments with deep networks"
    - "learning curriculum policies for reinforcement learning"
    - "screenernet learning self paced curriculum for deep neural networks"

Connected through hyperedge HE-3 (induced by source paper "language as a cognitive tool to imagine goals in curiosity driven exploration"):
  with members:
    - "emergent systematic generalization in a situated agent"
    - "skew fit state covering self supervised reinforcement learning"
    - "language as an abstraction for hierarchical deep reinforcement learning"
    - "monet unsupervised scene decomposition and representation"
    - "extending machine language models toward human level language understanding"
    - "using natural language for reward shaping in reinforcement learning"
    - "on the limitations of representing functions on sets"
    - "from language to goals inverse reinforcement learning for vision based instruction following"

Connected through hyperedge HE-4 (induced by source paper "adversarial active exploration for inverse dynamics model learning"):
  with members:
    - "multi goal reinforcement learning challenging robotics environments and request for research"
    - "curiosity driven exploration of learned disentangled goal spaces"
    - "curious intrinsically motivated modular multi goal reinforcement learning"
    - "parameter space noise for exploration"
    - "hindsight experience replay"
    - "combining self supervised learning and imitation for vision based rope manipulation"
    - "learning how to active learn a deep reinforcement learning approach"
    - "robust adversarial reinforcement learning"

Connected through hyperedge HE-5 (induced by source paper "intrinsic motivation and episodic memories for robot exploration of high dimensional sensory spaces"):
  with members:
    - "continual lifelong learning with neural networks a review"
    - "curious intrinsically motivated modular multi goal reinforcement learning"
    - "alleviating catastrophic forgetting using context dependent gating and synaptic stabilization"
    - "intrinsically motivated goal exploration processes with automatic curriculum learning"

Connected through hyperedge HE-6 (induced by source paper "continual lifelong learning with neural networks a review"):
  with members:
    - "lifelong learning of spatiotemporal representations with dual memory recurrent self organization"
    - "continuous learning in single incremental task scenarios"
    - "born to learn the inspiration progress and future of evolved plastic artificial neural networks"
    - "on the role of neurogenesis in overcoming catastrophic forgetting"
    - "a neurorobotic experiment for crossmodal conflict resolution in complex environments"
    - "deep generative dual memory network for continual learning"
    - "overcoming catastrophic forgetting with hard attention to the task"
    - "expectation learning for adaptive crossmodal stimuli association"

Connected through hyperedge HE-7 (induced by source paper "exploration via hindsight goal generation"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "skew fit state covering self supervised reinforcement learning"
    - "maximum entropy regularized multi goal reinforcement learning"
    - "addressing sample complexity in visual tasks using her and hallucinatory gans"
    - "search on the replay buffer bridging planning and reinforcement learning"
    - "learning actionable representations with goal conditioned policies"
    - "visual reinforcement learning with imagined goals"
    - "gep pg decoupling exploration and exploitation in deep reinforcement learning algorithms"

Connected through hyperedge HE-8 (induced by source paper "skew fit state covering self supervised reinforcement learning"):
  with members:
    - "self supervised learning of image embedding for continuous control"
    - "provably efficient maximum entropy exploration"
    - "exploration by random network distillation"
    - "temporal difference models model free deep rl for model based control"
    - "unsupervised meta learning for reinforcement learning"
    - "visual reinforcement learning with imagined goals"
    - "gep pg decoupling exploration and exploitation in deep reinforcement learning algorithms"
    - "large scale study of curiosity driven learning"

Question: Please tell me which class the center node 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)