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: "multi objective model based policy search for data efficient learning with sparse rewards"
  Abstract: The most data-efficient algorithms for reinforcement learning in robotics are model-based policy search algorithms, which alternate between learning a dynamical model of the robot and optimizing a policy to maximize the expected return given the model and its uncertainties. However, the current algorithms lack an effective exploration strategy to deal with sparse or misleading reward scenarios: if they do not experience any state with a positive reward during the initial random exploration, it is very unlikely to solve the problem. Here, we propose a novel model-based policy search algorithm, Multi-DEX, that leverages a learned dynamical model to efficiently explore the task space and solve tasks with sparse rewards in a few episodes. To achieve this, we frame the policy search problem as a multi-objective, model-based policy optimization problem with three objectives: (1) generate maximally novel state trajectories, (2) maximize the expected return and (3) keep the system in state-space regions for which the model is as accurate as possible. We then optimize these objectives using a Pareto-based multi-objective optimization algorithm. The experiments show that Multi-DEX is able to solve sparse reward scenarios (with a simulated robotic arm) in much lower interaction time than VIME, TRPO, GEP-PG, CMA-ES and Black-DROPS.

Connected through hyperedge HE-1 (induced by source paper "domain adversarial and conditional state space model for imitation learning"):
  with members:
    - "to follow or not to follow selective imitation learning from observations"
    - "variational inference mpc for bayesian model based reinforcement learning"
    - "integration of imitation learning using gail and reinforcement learning using task achievement rewards via probabilistic generative model"
    - "learning belief representations for imitation learning in pomdps"
    - "learning robotic manipulation through visual planning and acting"
    - "stochastic latent actor critic deep reinforcement learning with a latent variable model"
    - "recent advances in imitation learning from observation"
    - "reinforcement learning and control as probabilistic inference tutorial and review"

Connected through hyperedge HE-2 (induced by source paper "fast online adaptation in robotics through meta learning embeddings of simulated priors"):
  with members:
    - "adaptive prior selection for repertoire based online adaptation in robotics"
    - "reset free trial and error learning for robot damage recovery"
    - "on first order meta learning algorithms"
    - "efficient transfer learning and online adaptation with latent variable models for continuous control"
    - "deep reinforcement learning in a handful of trials using probabilistic dynamics models"
    - "a survey on policy search algorithms for learning robot controllers in a handful of trials"
    - "bayesian optimization with automatic prior selection for data efficient direct policy search"
    - "neural network dynamics for model based deep reinforcement learning with model free fine tuning"

Connected through hyperedge HE-3 (induced by source paper "adaptive prior selection for repertoire based online adaptation in robotics"):
  with members:
    - "dynamics aware unsupervised discovery of skills"
    - "reset free trial and error learning for robot damage recovery"
    - "deep reinforcement learning in a handful of trials using probabilistic dynamics models"
    - "a survey on policy search algorithms for learning robot controllers in a handful of trials"
    - "patchwork kriging for large scale gaussian process regression"
    - "bayesian optimization with automatic prior selection for data efficient direct policy search"
    - "emergence of locomotion behaviours in rich environments"
    - "quality and diversity optimization a unifying modular framework"

Connected through hyperedge HE-4 (induced by source paper "curiosity driven multi criteria hindsight experience replay"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "accuracy based curriculum learning in deep reinforcement learning"
    - "exploration by random network distillation"
    - "improvements on hindsight learning"
    - "data efficient deep reinforcement learning for dexterous manipulation"
    - "learning to play with intrinsically motivated self aware agents"
    - "large scale study of curiosity driven learning"
    - "curiosity driven experience prioritization via density estimation"

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)