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 "unsupervised meta learning for reinforcement learning"):
  Abstract: Meta-learning is a powerful tool that builds on multi-task learning to learn how to quickly adapt a model to new tasks. In the context of reinforcement learning, meta-learning algorithms can acquire reinforcement learning procedures to solve new problems more efficiently by meta-learning prior tasks. The performance of meta-learning algorithms critically depends on the tasks available for meta-training: in the same way that supervised learning algorithms generalize best to test points drawn from the same distribution as the training points, meta-learning methods generalize best to tasks from the same distribution as the meta-training tasks. In effect, meta-reinforcement learning offloads the design burden from algorithm design to task design. If we can automate the process of task design as well, we can devise a meta-learning algorithm that is truly automated. In this work, we take a step in this direction, proposing a family of unsupervised meta-learning algorithms for reinforcement learning. We describe a general recipe for unsupervised meta-reinforcement learning, and describe an effective instantiation of this approach based on a recently proposed unsupervised exploration technique and model-agnostic meta-learning. We also discuss practical and conceptual considerations for developing unsupervised meta-learning methods. Our experimental results demonstrate that unsupervised meta-reinforcement learning effectively acquires accelerated reinforcement learning procedures without the need for manual task design, significantly exceeds the performance of learning from scratch, and even matches performance of meta-learning methods that use hand-specified task distributions.

Includes members:
  Member "efficient off policy meta reinforcement learning via probabilistic context variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rapidly adaptable legged robots via evolutionary meta learning")
  Member "efficient exploration via state marginal matching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "some considerations on learning to explore via meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "meta learning curiosity algorithms")
  Member "universal planning networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning functionally decomposed hierarchies for continuous control tasks")
  Member "temporal difference models model free deep rl for model based control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rewriting history with inverse rl hindsight inference for policy improvement")
  Member "learning to adapt in dynamic real world environments through meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "revisiting meta learning as supervised learning")
  Member "unsupervised learning via meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "revisiting meta learning as supervised learning")
  Member "meta reinforcement learning of structured exploration strategies":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "meta learning curiosity algorithms")

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.LG(Machine Learning)