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 "meta reinforcement learning of structured exploration strategies"):
  Abstract: Exploration is a fundamental challenge in reinforcement learning (RL). Many of the current exploration methods for deep RL use task-agnostic objectives, such as information gain or bonuses based on state visitation. However, many practical applications of RL involve learning more than a single task, and prior tasks can be used to inform how exploration should be performed in new tasks. In this work, we explore how prior tasks can inform an agent about how to explore effectively in new situations. We introduce a novel gradient-based fast adaptation algorithm -- model agnostic exploration with structured noise (MAESN) -- to learn exploration strategies from prior experience. The prior experience is used both to initialize a policy and to acquire a latent exploration space that can inject structured stochasticity into a policy, producing exploration strategies that are informed by prior knowledge and are more effective than random action-space noise. We show that MAESN is more effective at learning exploration strategies when compared to prior meta-RL methods, RL without learned exploration strategies, and task-agnostic exploration methods. We evaluate our method on a variety of simulated tasks: locomotion with a wheeled robot, locomotion with a quadrupedal walker, and object manipulation.

Includes members:
  Member "some considerations on learning to explore via meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "meta learning curiosity algorithms")
  Member "parameter space noise for exploration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective diversity in population based reinforcement learning")
  Member "one shot visual imitation learning via meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "revisiting meta learning as supervised learning")
  Member "prototypical networks for few shot learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "meta learning and universality deep representations and gradient descent can approximate any learning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "revisiting meta learning as supervised learning")
  Member "meta sgd learning to learn quickly for few shot learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "noisy networks for exploration":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "challenges and countermeasures for adversarial attacks on deep reinforcement learning")
  Member "learning to reinforcement learn":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep reinforcement learning for autonomous driving a survey")

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)