human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "meta reinforcement learning with task embedding and shared policy"
  Abstract: Despite significant progress, deep reinforcement learning (RL) suffers from data-inefficiency and limited generalization. Recent efforts apply meta-learning to learn a meta-learner from a set of RL tasks such that a novel but related task could be solved quickly. Though specific in some ways, different tasks in meta-RL are generally similar at a high level. However, most meta-RL methods do not explicitly and adequately model the specific and shared information among different tasks, which limits their ability to learn training tasks and to generalize to novel tasks. In this paper, we propose to capture the shared information on the one hand and meta-learn how to quickly abstract the specific information about a task on the other hand. Methodologically, we train an SGD meta-learner to quickly optimize a task encoder for each task, which generates a task embedding based on past experience. Meanwhile, we learn a policy which is shared across all tasks and conditioned on task embeddings. Empirical results on four simulated tasks demonstrate that our method has better learning capacity on both training and novel tasks and attains up to 3 to 4 times higher returns compared to baselines.

Connected through hyperedge HE-1 (induced by source paper "hyper meta reinforcement learning with sparse reward"):
  with members:
    - "meta inverse reinforcement learning with probabilistic context variables"
    - "dealing with sparse rewards in reinforcement learning"
    - "mame model agnostic meta exploration"
    - "norml no reward meta learning"
    - "reward shaping via meta learning"
    - "meta gradient reinforcement learning"
    - "meta reinforcement learning of structured exploration strategies"
    - "learning to adapt meta learning for model based control"

Connected through hyperedge HE-2 (induced by source paper "solving rubik s cube with a robot hand"):
  with members:
    - "sampling based planning of in hand manipulation with external pushes"
    - "active domain randomization"
    - "ai gas ai generating algorithms an alternate paradigm for producing general artificial intelligence"
    - "distilling policy distillation"
    - "deep dynamics models for learning dexterous manipulation"
    - "meta reinforcement learning as task inference"
    - "deceptionnet network driven domain randomization"
    - "meta sim learning to generate synthetic datasets"

Connected through hyperedge HE-3 (induced by source paper "varibad a very good method for bayes adaptive deep rl via meta learning"):
  with members:
    - "meta learning of sequential strategies"
    - "meta amortized variational inference and learning"
    - "efficient off policy meta reinforcement learning via probabilistic context variables"
    - "meta reinforcement learning as task inference"
    - "some considerations on learning to explore via meta reinforcement learning"
    - "on first order meta learning algorithms"
    - "reptile a scalable metalearning algorithm"
    - "fast context adaptation via meta learning"

Question: Please tell me which class the center node 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)