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 "adaptive compression based lifelong learning"):
  Abstract: The problem of a deep learning model losing performance on a previously learned task when fine-tuned to a new one is a phenomenon known as Catastrophic forgetting. There are two major ways to mitigate this problem: either preserving activations of the initial network during training with a new task; or restricting the new network activations to remain close to the initial ones. The latter approach falls under the denomination of lifelong learning, where the model is updated in a way that it performs well on both old and new tasks, without having access to the old task's training samples anymore. Recently, approaches like pruning networks for freeing network capacity during sequential learning of tasks have been gaining in popularity. Such approaches allow learning small networks while making redundant parameters available for the next tasks. The common problem encountered with these approaches is that the pruning percentage is hard-coded, irrespective of the number of samples, of the complexity of the learning task and of the number of classes in the dataset. We propose a method based on Bayesian optimization to perform adaptive compression/pruning of the network and show its effectiveness in lifelong learning. Our method learns to perform heavy pruning for small and/or simple datasets while using milder compression rates for large and/or complex data. Experiments on classification and semantic segmentation demonstrate the applicability of learning network compression, where we are able to effectively preserve performances along sequences of tasks of varying complexity.

Includes members:
  Member "dense fusion classmate network for land cover classification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dense dilated convolutions merging network for land cover classification")
  Member "piggyback adapting a single network to multiple tasks by learning to mask weights":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "few shot few shot learning and the role of spatial attention")
  Member "overcoming catastrophic forgetting with hard attention to the task":
    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 "packnet adding multiple tasks to a single network by iterative pruning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "encoder based lifelong learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "disassembling the dataset a camera alignment mechanism for multiple tasks in person re identification")
  Member "overcoming catastrophic forgetting by incremental moment matching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ternary feature masks continual learning without any forgetting")
  Member "overcoming catastrophic forgetting in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on contextual embeddings")
  Member "learning without forgetting":
    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.CV(Computer Vision and Pattern Recognition)