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 to learn without forgetting by maximizing transfer and minimizing interference"):
  Abstract: Lack of performance when it comes to continual learning over non-stationary distributions of data remains a major challenge in scaling neural network learning to more human realistic settings. In this work we propose a new conceptualization of the continual learning problem in terms of a temporally symmetric trade-off between transfer and interference that can be optimized by enforcing gradient alignment across examples. We then propose a new algorithm, Meta-Experience Replay (MER), that directly exploits this view by combining experience replay with optimization based meta-learning. This method learns parameters that make interference based on future gradients less likely and transfer based on future gradients more likely. We conduct experiments across continual lifelong supervised learning benchmarks and non-stationary reinforcement learning environments demonstrating that our approach consistently outperforms recently proposed baselines for continual learning. Our experiments show that the gap between the performance of MER and baseline algorithms grows both as the environment gets more non-stationary and as the fraction of the total experiences stored gets smaller.

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 "learning abstract options":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning hierarchical teaching policies for cooperative agents")
  Member "reptile a scalable metalearning algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unsupervised domain adaptive object detection using forward backward cyclic adaptation")
  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 "overcoming catastrophic forgetting with hard attention to the task":
    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 "learning robust options":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust deep reinforcement learning against adversarial perturbations on observations")
  Member "outrageously large neural networks the sparsely gated mixture of experts layer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "attention over parameters for dialogue systems")
  Member "lifelong learning with dynamically expandable networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual 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)