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 without memorization"):
  Abstract: The ability to learn new concepts with small amounts of data is a critical aspect of intelligence that has proven challenging for deep learning methods. Meta-learning has emerged as a promising technique for leveraging data from previous tasks to enable efficient learning of new tasks. However, most meta-learning algorithms implicitly require that the meta-training tasks be mutually-exclusive, such that no single model can solve all of the tasks at once. For example, when creating tasks for few-shot image classification, prior work uses a per-task random assignment of image classes to N-way classification labels. If this is not done, the meta-learner can ignore the task training data and learn a single model that performs all of the meta-training tasks zero-shot, but does not adapt effectively to new image classes. This requirement means that the user must take great care in designing the tasks, for example by shuffling labels or removing task identifying information from the inputs. In some domains, this makes meta-learning entirely inapplicable. In this paper, we address this challenge by designing a meta-regularization objective using information theory that places precedence on data-driven adaptation. This causes the meta-learner to decide what must be learned from the task training data and what should be inferred from the task testing input. By doing so, our algorithm can successfully use data from non-mutually-exclusive tasks to efficiently adapt to novel tasks. We demonstrate its applicability to both contextual and gradient-based meta-learning algorithms, and apply it in practical settings where applying standard meta-learning has been difficult. Our approach substantially outperforms standard meta-learning algorithms in these settings.

Includes members:
  Member "efficient off policy meta reinforcement learning via probabilistic context variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rapidly adaptable legged robots via evolutionary meta learning")
  Member "towards understanding generalization in gradient based meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wide minima density hypothesis and the explore exploit learning rate schedule")
  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 "fast context adaptation via meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "meta learning for mixed linear regression")
  Member "bayesian model agnostic meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "is the meta learning idea able to improve the generalization of deep neural networks on the standard supervised learning")
  Member "conditional neural processes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "local nonparametric meta learning")
  Member "learning to adapt in dynamic real world environments through meta reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "revisiting meta learning as supervised learning")
  Member "meta learning priors for efficient online bayesian regression":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "meta learning for mixed linear regression")

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)