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 "side tuning network adaptation via additive side networks"):
  Abstract: When training a neural network for a desired task, one may prefer to adapt a pre-trained network rather than start with a randomly initialized one -- due to lacking enough training data, performing lifelong learning where the system has to learn a new task while being previously trained for other tasks, or wishing to encode priors in the network via preset weights. The most commonly employed approaches for network adaptation are fine-tuning and using the pre-trained network as a fixed feature extractor, among others. #R##N#In this paper, we propose a straightforward alternative: Side-Tuning. Side-tuning adapts a pre-trained network by training a lightweight "side" network that is fused with the (unchanged) pre-trained network using summation. This simple method works as well as or better than existing solutions while it resolves some of the basic issues with fine-tuning, fixed features, and several other common baselines. In particular, side-tuning is less prone to overfitting when little training data is available, yields better results than using a fixed feature extractor, and does not suffer from catastrophic forgetting in lifelong learning. We demonstrate the performance of side-tuning under a diverse set of scenarios, including lifelong learning (iCIFAR, Taskonomy), reinforcement learning, imitation learning (visual navigation in Habitat), NLP question-answering (SQuAD v2), and single-task transfer learning (Taskonomy), with consistently promising results.

Includes members:
  Member "on the variance of the adaptive learning rate and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "rapid learning or feature reuse towards understanding the effectiveness of maml":
    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 "superposition of many models into one":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi task learning by a top down control network")
  Member "habitat a platform for embodied ai research":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "why build an assistant in minecraft")
  Member "residual policy learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "brpo batch residual policy optimization")
  Member "taskonomy disentangling task transfer learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "efficient lifelong learning with a gem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "know what you don t know unanswerable questions for squad":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "description based text classification with reinforcement 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)