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 "learning continually from low shot data stream"):
  Abstract: While deep learning has achieved remarkable results on various applications, it is usually data hungry and struggles to learn over non-stationary data stream. To solve these two limits, the deep learning model should not only be able to learn from a few of data, but also incrementally learn new concepts from data stream over time without forgetting the previous knowledge. Limited literature simultaneously address both problems. In this work, we propose a novel approach, MetaCL, which enables neural networks to effectively learn meta knowledge from low-shot data stream without catastrophic forgetting. MetaCL trains a model to exploit the intrinsic feature of data (i.e. meta knowledge) and dynamically penalize the important model parameters change to preserve learned knowledge. In this way, the deep learning model can efficiently obtain new knowledge from small volume of data and still keep high performance on previous tasks. MetaCL is conceptually simple, easy to implement and model-agnostic. We implement our method on three recent regularization-based methods. Extensive experiments show that our approach leads to state-of-the-art performance on image classification benchmarks.

Includes members:
  Member "on first order meta learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "efficient lifelong learning with a gem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "riemannian walk for incremental learning understanding forgetting and intransigence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "dynamic few shot visual learning without forgetting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning representations by predicting bags of visual words")
  Member "memory aware synapses learning what not to forget":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "progressive neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "lifelong learning with dynamically expandable networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "prototypical networks for few shot learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")

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)