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 "efficient lifelong learning with a gem"):
  Abstract: In lifelong learning, the learner is presented with a sequence of tasks, incrementally building a data-driven prior which may be leveraged to speed up learning of a new task. In this work, we investigate the efficiency of current lifelong approaches, in terms of sample complexity, computational and memory cost. Towards this end, we first introduce a new and a more realistic evaluation protocol, whereby learners observe each example only once and hyper-parameter selection is done on a small and disjoint set of tasks, which is not used for the actual learning experience and evaluation. Second, we introduce a new metric measuring how quickly a learner acquires a new skill. Third, we propose an improved version of GEM (Lopez-Paz & Ranzato, 2017), dubbed Averaged GEM (A-GEM), which enjoys the same or even better performance as GEM, while being almost as computationally and memory efficient as EWC (Kirkpatrick et al., 2016) and other regularization-based methods. Finally, we show that all algorithms including A-GEM can learn even more quickly if they are provided with task descriptors specifying the classification tasks under consideration. Our experiments on several standard lifelong learning benchmarks demonstrate that A-GEM has the best trade-off between accuracy and efficiency.

Includes members:
  Member "modular meta learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "meta learning curiosity algorithms")
  Member "reinforced continual learning":
    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 "large scale visual relationship understanding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")
  Member "riemannian walk for incremental learning understanding forgetting and intransigence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "automatically composing representation transformations as a means for generalization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards modular algorithm induction")
  Member "memory aware synapses learning what not to forget":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "routing networks adaptive selection of non linear functions for multi task learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "attention over parameters for dialogue systems")

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)