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 curricula for visual meta reinforcement learning"):
  Abstract: In principle, meta-reinforcement learning algorithms leverage experience across many tasks to learn fast reinforcement learning (RL) strategies that transfer to similar tasks. However, current meta-RL approaches rely on manually-defined distributions of training tasks, and hand-crafting these task distributions can be challenging and time-consuming. Can "useful" pre-training tasks be discovered in an unsupervised manner? We develop an unsupervised algorithm for inducing an adaptive meta-training task distribution, i.e. an automatic curriculum, by modeling unsupervised interaction in a visual environment. The task distribution is scaffolded by a parametric density model of the meta-learner's trajectory distribution. We formulate unsupervised meta-RL as information maximization between a latent task variable and the meta-learner's data distribution, and describe a practical instantiation which alternates between integration of recent experience into the task distribution and meta-learning of the updated tasks. Repeating this procedure leads to iterative reorganization such that the curriculum adapts as the meta-learner's data distribution shifts. In particular, we show how discriminative clustering for visual representation can support trajectory-level task acquisition and exploration in domains with pixel observations, avoiding pitfalls of alternatives. In experiments on vision-based navigation and manipulation domains, we show that the algorithm allows for unsupervised meta-learning that transfers to downstream tasks specified by hand-crafted reward functions and serves as pre-training for more efficient supervised meta-learning of test 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 "some considerations on learning to explore via meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "meta learning curiosity algorithms")
  Member "exploration by random network distillation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transformation based adversarial video prediction on large scale data")
  Member "unsupervised meta learning for reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "solving rubik s cube with a robot hand")
  Member "visual reinforcement learning with imagined goals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "universal value density estimation for imitation learning and goal conditioned reinforcement learning")
  Member "deep clustering for unsupervised learning of visual features":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning representations by predicting bags of visual words")
  Member "model based active exploration":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "action for better prediction")

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.AI(Artificial Intelligence)