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 learning of sequential strategies"):
  Abstract: In this report we review memory-based meta-learning as a tool for building sample-efficient strategies that learn from past experience to adapt to any task within a target class. Our goal is to equip the reader with the conceptual foundations of this tool for building new, scalable agents that operate on broad domains. To do so, we present basic algorithmic templates for building near-optimal predictors and reinforcement learners which behave as if they had a probabilistic model that allowed them to efficiently exploit task structure. Furthermore, we recast memory-based meta-learning within a Bayesian framework, showing that the meta-learned strategies are near-optimal because they amortize Bayes-filtered data, where the adaptation is implemented in the memory dynamics as a state-machine of sufficient statistics. Essentially, memory-based meta-learning translates the hard problem of probabilistic sequential inference into a regression problem.

Includes members:
  Member "continual lifelong learning with neural networks a review":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  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 "recasting gradient based meta learning as hierarchical bayes":
    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 "reptile a scalable metalearning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unsupervised domain adaptive object detection using forward backward cyclic adaptation")
  Member "causal reasoning from meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "badger learning to learn learning algorithms through multi agent communication")
  Member "conditional neural processes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "local nonparametric meta learning")
  Member "sample efficient adaptive text to speech":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dawson a domain adaptive few shot generation framework")
  Member "modeling friends and foes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "from poincar e recurrence to convergence in imperfect information games finding equilibrium via regularization")

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)