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: "learning latent plans from play"
  Abstract: We propose learning from teleoperated play data (LfP) as a way to scale up multi-task robotic skill learning. Learning from play (LfP) offers three main advantages: 1) It is cheap. Large amounts of play data can be collected quickly as it does not require scene staging, task segmenting, or resetting to an initial state. 2) It is general. It contains both functional and non-functional behavior, relaxing the need for a predefined task distribution. 3) It is rich. Play involves repeated, varied behavior and naturally leads to high coverage of the possible interaction space. These properties distinguish play from expert demonstrations, which are rich, but expensive, and scripted unattended data collection, which is cheap, but insufficiently rich. Variety in play, however, presents a multimodality challenge to methods seeking to learn control on top. To this end, we introduce Play-LMP, a method designed to handle variability in the LfP setting by organizing it in an embedding space. Play-LMP jointly learns 1) reusable latent plan representations unsupervised from play data and 2) a single goal-conditioned policy capable of decoding inferred plans to achieve user-specified tasks. We show empirically that Play-LMP, despite not being trained on task-specific data, is capable of generalizing to 18 complex user-specified manipulation tasks with average success of 85.5%, outperforming individual models trained on expert demonstrations (success of 70.3%). Furthermore, we find that play-supervised models, unlike their expert-trained counterparts, 1) are more robust to perturbations and 2) exhibit retrying-till-success. Finally, despite never being trained with task labels, we find that our agent learns to organize its latent plan space around functional tasks. Videos of the performed experiments are available at learning-from-play.github.io

Connected through hyperedge HE-1 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills"):
  with members:
    - "solving rubik s cube with a robot hand"
    - "the minerl competition on sample efficient reinforcement learning using human priors"
    - "go explore a new approach for hard exploration problems"
    - "skew fit state covering self supervised reinforcement learning"
    - "dynamics aware unsupervised discovery of skills"
    - "self supervised learning of image embedding for continuous control"
    - "momentum contrast for unsupervised visual representation learning"
    - "data efficient image recognition with contrastive predictive coding"

Connected through hyperedge HE-2 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement"):
  with members:
    - "gradient surgery for multi task learning"
    - "efficient off policy meta reinforcement learning via probabilistic context variables"
    - "learning to reach goals without reinforcement learning"
    - "search on the replay buffer bridging planning and reinforcement learning"
    - "meta world a benchmark and evaluation for multi task and meta reinforcement learning"
    - "advantage weighted regression simple and scalable off policy reinforcement learning"
    - "deepmind control suite"
    - "reinforcement learning and control as probabilistic inference tutorial and review"

Connected through hyperedge HE-3 (induced by source paper "learning to generalize across long horizon tasks from human demonstrations"):
  with members:
    - "iris implicit reinforcement without interaction at scale for learning control from offline robot manipulation data"
    - "learning deep parameterized skills from demonstration for re targetable visuomotor control"
    - "deep local trajectory replanning and control for robot navigation"
    - "avid learning multi stage tasks via pixel level translation of human videos"
    - "scaling robot supervision to hundreds of hours with roboturk robotic manipulation dataset through human reasoning and dexterity"
    - "learning to optimize join queries with deep reinforcement learning"
    - "neural task graphs generalizing to unseen tasks from a single video demonstration"
    - "roboturk a crowdsourcing platform for robotic skill learning through imitation"

Connected through hyperedge HE-4 (induced by source paper "squirl robust and efficient learning from video demonstration of long horizon robotic manipulation tasks"):
  with members:
    - "meta inverse reinforcement learning with probabilistic context variables"
    - "a divergence minimization perspective on imitation learning methods"
    - "motion reasoning for goal based imitation learning"
    - "deepmind control suite"
    - "neural task graphs generalizing to unseen tasks from a single video demonstration"
    - "one shot hierarchical imitation learning of compound visuomotor tasks"
    - "one shot imitation from observing humans via domain adaptive meta learning"
    - "one shot visual imitation learning via meta learning"

Connected through hyperedge HE-5 (induced by source paper "solving rubik s cube with a robot hand"):
  with members:
    - "sampling based planning of in hand manipulation with external pushes"
    - "active domain randomization"
    - "meta reinforcement learning with task embedding and shared policy"
    - "ai gas ai generating algorithms an alternate paradigm for producing general artificial intelligence"
    - "distilling policy distillation"
    - "deep dynamics models for learning dexterous manipulation"
    - "meta reinforcement learning as task inference"
    - "deceptionnet network driven domain randomization"

Connected through hyperedge HE-6 (induced by source paper "robonet large scale multi robot learning"):
  with members:
    - "self supervised exploration via disagreement"
    - "tossingbot learning to throw arbitrary objects with residual physics"
    - "manipulation by feel touch based control with deep predictive models"
    - "improvisation through physical understanding using novel objects as tools with visual foresight"
    - "unsupervised visuomotor control through distributional planning networks"
    - "scaling autoregressive video models"
    - "exploration by random network distillation"
    - "time reversal as self supervision"

Connected through hyperedge HE-7 (induced by source paper "the differentiable cross entropy method"):
  with members:
    - "variational inference mpc for bayesian model based reinforcement learning"
    - "exploring model based planning with policy networks"
    - "the limited multi label projection layer"
    - "bayesian optimization in variational latent spaces with dynamic compression"
    - "unsupervised state representation learning in atari"
    - "adaptive and safe bayesian optimization in high dimensions via one dimensional subspaces"
    - "learning action representations for reinforcement learning"
    - "deepmdp learning continuous latent space models for representation learning"

Connected through hyperedge HE-8 (induced by source paper "search on the replay buffer bridging planning and reinforcement learning"):
  with members:
    - "self supervised learning of image embedding for continuous control"
    - "the laplacian in rl learning representations with efficient approximations"
    - "universal planning networks"
    - "hierarchical reinforcement learning with hindsight"
    - "temporal difference models model free deep rl for model based control"
    - "model ensemble trust region policy optimization"
    - "learning navigation behaviors end to end with autorl"
    - "semi parametric topological memory for navigation"

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.RO(Robotics)