human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "lifelong learning with dynamically expandable networks"
  Abstract: We propose a novel deep network architecture for lifelong learning which we refer to as Dynamically Expandable Network (DEN), that can dynamically decide its network capacity as it trains on a sequence of tasks, to learn a compact overlapping knowledge sharing structure among tasks. DEN is efficiently trained in an online manner by performing selective retraining, dynamically expands network capacity upon arrival of each task with only the necessary number of units, and effectively prevents semantic drift by splitting/duplicating units and timestamping them. We validate DEN on multiple public datasets under lifelong learning scenarios, on which it not only significantly outperforms existing lifelong learning methods for deep networks, but also achieves the same level of performance as the batch counterparts with substantially fewer number of parameters. Further, the obtained network fine-tuned on all tasks obtained significantly better performance over the batch models, which shows that it can be used to estimate the optimal network structure even when all tasks are available in the first place.

Connected through hyperedge HE-1 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning"):
  with members:
    - "learning to continually learn"
    - "fine grained continual learning"
    - "continuous meta learning without tasks"
    - "reinforcement learning in non stationary environments"
    - "online learned continual compression with stacked quantization modules"
    - "continual lifelong learning with neural networks a review"
    - "online meta learning"
    - "regularization shortcomings for continual learning"

Connected through hyperedge HE-2 (induced by source paper "few shot few shot learning and the role of spatial attention"):
  with members:
    - "dense classification and implanting for few shot learning"
    - "few shot learning with localization in realistic settings"
    - "revisiting local descriptor based image to class measure for few shot learning"
    - "finding task relevant features for few shot learning by category traversal"
    - "large scale long tailed recognition in an open world"
    - "a closer look at few shot classification"
    - "few shot learning with metric agnostic conditional embeddings"
    - "deep clustering for unsupervised learning of visual features"

Connected through hyperedge HE-3 (induced by source paper "continual universal object detection"):
  with members:
    - "distilling object detectors with fine grained feature imitation"
    - "continual lifelong learning with neural networks a review"
    - "towards universal object detection by domain attention"
    - "continual learning a comparative study on how to defy forgetting in classification tasks"
    - "learning without memorizing"
    - "cross domain weakly supervised object detection through progressive domain adaptation"
    - "rotate your networks better weight consolidation and less catastrophic forgetting"
    - "piggyback adapting a single network to multiple tasks by learning to mask weights"

Connected through hyperedge HE-4 (induced by source paper "on catastrophic interference in atari 2600 games"):
  with members:
    - "go explore a new approach for hard exploration problems"
    - "continual unsupervised representation learning"
    - "continual lifelong learning with neural networks a review"
    - "ray interference a source of plateaus in deep reinforcement learning"
    - "benchmarking bonus based exploration methods on the arcade learning environment"
    - "dopamine a research framework for deep reinforcement learning"
    - "exploration by random network distillation"
    - "task free continual learning"

Connected through hyperedge HE-5 (induced by source paper "a neural dirichlet process mixture model for task free continual learning"):
  with members:
    - "learn to grow a continual structure learning framework for overcoming catastrophic forgetting"
    - "on tiny episodic memories in continual learning"
    - "continual lifelong learning with neural networks a review"
    - "gradient based sample selection for online continual learning"
    - "task free continual learning"
    - "re evaluating continual learning scenarios a categorization and case for strong baselines"
    - "reconciling meta learning and continual learning with online mixtures of tasks"
    - "continuous learning in single incremental task scenarios"

Connected through hyperedge HE-6 (induced by source paper "openloris object a robotic vision dataset and benchmark for lifelong deep learning"):
  with members:
    - "continual lifelong learning with neural networks a review"
    - "generative adversarial networks a survey and taxonomy"
    - "neural dynamics discovery via gaussian process recurrent neural networks"
    - "are we ready for service robots the openloris scene datasets for lifelong slam"
    - "neuroscore a brain inspired evaluation metric for generative adversarial networks"
    - "incremental classifier learning with generative adversarial networks"
    - "the limits and potentials of deep learning for robotics"
    - "don t forget there is more than forgetting new metrics for continual learning"

Connected through hyperedge HE-7 (induced by source paper "lifelong learning with searchable extension units"):
  with members:
    - "learn to grow a continual structure learning framework for overcoming catastrophic forgetting"
    - "continual lifelong learning with neural networks a review"
    - "multinomial distribution learning for effective neural architecture search"
    - "incremental classifier learning with generative adversarial networks"
    - "deep learning for classical japanese literature"
    - "reinforced continual learning"
    - "darts differentiable architecture search"
    - "overcoming catastrophic forgetting with hard attention to the task"

Connected through hyperedge HE-8 (induced by source paper "federated continual learning with adaptive parameter communication"):
  with members:
    - "federated learning with matched averaging"
    - "scalable and order robust continual learning with additive parameter decomposition"
    - "communication efficient federated deep learning with asynchronous model update and temporally weighted aggregation"
    - "asynchronous online federated learning for edge devices"
    - "federated optimization for heterogeneous networks"
    - "efficient lifelong learning with a gem"
    - "reinforced continual learning"
    - "overcoming catastrophic forgetting with hard attention to the task"

Question: Please tell me which class the center node 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)