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 "hierarchical reinforcement learning for zero shot generalization with subtask dependencies"):
  Abstract: We introduce a new RL problem where the agent is required to generalize to a previously-unseen environment characterized by a subtask graph which describes a set of subtasks and their dependencies. Unlike existing hierarchical multitask RL approaches that explicitly describe what the agent should do at a high level, our problem only describes properties of subtasks and relationships among them, which requires the agent to perform complex reasoning to find the optimal subtask to execute. To solve this problem, we propose a neural subtask graph solver (NSGS) which encodes the subtask graph using a recursive neural network embedding. To overcome the difficulty of training, we propose a novel non-parametric gradient-based policy, graph reward propagation, to pre-train our NSGS agent and further finetune it through actor-critic method. The experimental results on two 2D visual domains show that our agent can perform complex reasoning to find a near-optimal way of executing the subtask graph and generalize well to the unseen subtask graphs. In addition, we compare our agent with a Monte-Carlo tree search (MCTS) method showing that our method is much more efficient than MCTS, and the performance of NSGS can be further improved by combining it with MCTS.

Includes members:
  Member "neural task graphs generalizing to unseen tasks from a single video demonstration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to generalize across long horizon tasks from human demonstrations")
  Member "a deep compositional framework for human like language acquisition in virtual environment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "meta reinforcement learning with autonomous inference of subtask dependencies")
  Member "zero shot task generalization with multi task deep reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on catastrophic interference in atari 2600 games")
  Member "autonomous extracting a hierarchical structure of tasks in reinforcement learning and multi task reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "meta reinforcement learning with autonomous inference of subtask dependencies")
  Member "modular multitask reinforcement learning with policy sketches":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hierarchically decoupled imitation for morphological transfer")
  Member "neuro symbolic program synthesis":
    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 "high dimensional continuous control using generalized advantage estimation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "artificial intelligence for prosthetics challenge solutions")
  Member "actor mimic deep multitask and transfer reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")

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)