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 "scalable and order robust continual learning with additive parameter decomposition"):
  Abstract: While recent continual learning methods largely alleviate the catastrophic problem on toy-sized datasets, some issues remain to be tackled to apply them to real-world problem domains. First, a continual learning model should effectively handle catastrophic forgetting and be efficient to train even with a large number of tasks. Secondly, it needs to tackle the problem of order-sensitivity, where the performance of the tasks largely varies based on the order of the task arrival sequence, as it may cause serious problems where fairness plays a critical role (e.g. medical diagnosis). To tackle these practical challenges, we propose a novel continual learning method that is scalable as well as order-robust, which instead of learning a completely shared set of weights, represents the parameters for each task as a sum of task-shared and sparse task-adaptive parameters. With our Additive Parameter Decomposition (APD), the task-adaptive parameters for earlier tasks remain mostly unaffected, where we update them only to reflect the changes made to the task-shared parameters. This decomposition of parameters effectively prevents catastrophic forgetting and order-sensitivity, while being computation- and memory-efficient. Further, we can achieve even better scalability with APD using hierarchical knowledge consolidation, which clusters the task-adaptive parameters to obtain hierarchically shared parameters. We validate our network with APD, APD-Net, on multiple benchmark datasets against state-of-the-art continual learning methods, which it largely outperforms in accuracy, scalability, and order-robustness.

Includes members:
  Member "learn to grow a continual structure learning framework for overcoming catastrophic forgetting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a neural dirichlet process mixture model for task free continual learning")
  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 "reinforced continual learning":
    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 "piggyback adapting a single network to multiple tasks by learning to mask weights":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "few shot few shot learning and the role of spatial attention")
  Member "unsupervised representation learning by predicting image rotations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning representations by predicting bags of visual words")
  Member "overcoming catastrophic forgetting with hard attention to the task":
    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 "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)