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 "towards making deep transfer learning never hurt"):
  Abstract: Transfer learning have been frequently used to improve deep neural network training through incorporating weights of pre-trained networks as the starting-point of optimization for regularization. While deep transfer learning can usually boost the performance with better accuracy and faster convergence, transferring weights from inappropriate networks hurts training procedure and may lead to even lower accuracy. In this paper, we consider deep transfer learning as minimizing a linear combination of empirical loss and regularizer based on pre-trained weights, where the regularizer would restrict the training procedure from lowering the empirical loss, with conflicted descent directions (e.g., derivatives). Following the view, we propose a novel strategy making regularization-based Deep Transfer learning Never Hurt (DTNH) that, for each iteration of training procedure, computes the derivatives of the two terms separately, then re-estimates a new descent direction that does not hurt the empirical loss minimization while preserving the regularization affects from the pre-trained weights. Extensive experiments have been done using common transfer learning regularizers, such as L2-SP and knowledge distillation, on top of a wide range of deep transfer learning benchmarks including Caltech, MIT indoor 67, CIFAR-10 and ImageNet. The empirical results show that the proposed descent direction estimation strategy DTNH can always improve the performance of deep transfer learning tasks based on all above regularizers, even when transferring pre-trained weights from inappropriate networks. All in all, DTNH strategy can improve state-of-the-art regularizers in all cases with 0.1%--7% higher accuracy in all experiments.

Includes members:
  Member "do cifar 10 classifiers generalize to cifar 10":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "explicit inductive bias for transfer learning with convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "freeze discriminator a simple baseline for fine tuning gans")
  Member "parameter transfer unit for deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faster and safer training by embedding high level knowledge into deep reinforcement learning")
  Member "exploiting convolution filter patterns for transfer learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "delta deep learning transfer using feature map with attention for convolutional networks")
  Member "gradient episodic memory for continual learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "borrowing treasures from the wealthy deep transfer learning through selective joint fine tuning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rethinking the hyperparameters for fine tuning")
  Member "paying more attention to attention improving the performance of convolutional neural networks via attention transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "overcoming catastrophic forgetting in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey on contextual embeddings")

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)