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 "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

Includes members:
  Member "qt opt scalable deep reinforcement learning for vision based robotic manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic future prediction for video scene understanding")
  Member "temporal difference models model free deep rl for model based control":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement")
  Member "near optimal representation learning for hierarchical reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hierarchically decoupled imitation for morphological transfer")
  Member "visual reinforcement learning with imagined goals":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "balance between efficient and effective learning dense2sparse reward shaping for robot manipulation with environment uncertainty")
  Member "zero shot visual imitation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal value density estimation for imitation learning and goal conditioned reinforcement learning")
  Member "visual foresight model based deep reinforcement learning for vision based robotic control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probabilistic future prediction for video scene understanding")
  Member "soft actor critic algorithms and applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ready policy one world building through active learning")
  Member "behavioral cloning from observation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")

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