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 with autonomous inference of subtask dependencies"):
  Abstract: We propose and address a novel few-shot RL problem, where a task is characterized by a subtask graph which describes a set of subtasks and their dependencies that are unknown to the agent. The agent needs to quickly adapt to the task over few episodes during adaptation phase to maximize the return in the test phase. Instead of directly learning a meta-policy, we develop a Meta-learner with Subtask Graph Inference(MSGI), which infers the latent parameter of the task by interacting with the environment and maximizes the return given the latent parameter. To facilitate learning, we adopt an intrinsic reward inspired by upper confidence bound (UCB) that encourages efficient exploration. Our experiment results on two grid-world domains and StarCraft II environments show that the proposed method is able to accurately infer the latent task parameter, and to adapt more efficiently than existing meta RL and hierarchical RL methods.

Includes members:
  Member "neural logic machines":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relational neural machines")
  Member "on first order meta learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "bayesian model agnostic meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "is the meta learning idea able to improve the generalization of deep neural networks on the standard supervised learning")
  Member "hierarchical reinforcement learning for zero shot generalization with subtask dependencies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "plan arithmetic compositional plan vectors for multi task control")
  Member "meta reinforcement learning of structured exploration strategies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "meta learning curiosity algorithms")
  Member "neural task graphs generalizing to unseen tasks from a single video demonstration":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to generalize across long horizon tasks from human demonstrations")
  Member "probabilistic model agnostic meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a network pruning network approach to deep model compression")
  Member "learning explanatory rules from noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "analyzing differentiable fuzzy logic operators")

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)