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 "multi task learning with gradient guided policy specialization"):
  Abstract: We present a method for efficient learning of control policies for multiple related robotic motor skills. Our approach consists of two stages, joint training and specialization training. During the joint training stage, a neural network policy is trained with minimal information to disambiguate the motor skills. This forces the policy to learn a common representation of the different tasks. Then, during the specialization training stage we selectively split the weights of the policy based on a per-weight metric that measures the disagreement among the multiple tasks. By splitting part of the control policy, it can be further trained to specialize to each task. To update the control policy during learning, we use Trust Region Policy Optimization with Generalized Advantage Function (TRPOGAE). We propose a modification to the gradient update stage of TRPO to better accommodate multi-task learning scenarios. We evaluate our approach on three continuous motor skill learning problems in simulation: 1) a locomotion task where three single legged robots with considerable difference in shape and size are trained to hop forward, 2) a manipulation task where three robot manipulators with different sizes and joint types are trained to reach different locations in 3D space, and 3) locomotion of a two-legged robot, whose range of motion of one leg is constrained in different ways. We compare our training method to three baselines. The first baseline uses only joint training for the policy, the second trains independent policies for each task, and the last randomly selects weights to split. We show that our approach learns more efficiently than each of the baseline methods.

Includes members:
  Member "progressive neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "preparing for the unknown learning a universal policy with online system identification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rapidly adaptable legged robots via evolutionary meta learning")
  Member "pathnet evolution channels gradient descent in super neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "distral robust multitask reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "environment agnostic multitask learning for natural language grounded navigation")
  Member "stochastic neural networks for hierarchical reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "meta learning curiosity algorithms")
  Member "proximal policy optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "learning to push by grasping using multiple tasks for effective learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hierarchically decoupled imitation for morphological transfer")
  Member "learning and transfer of modulated locomotor controllers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "following instructions by imagining and reaching visual goals")

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)