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 "regularizing deep multi task networks using orthogonal gradients"):
  Abstract: Deep neural networks are a promising approach towards multi-task learning because of their capability to leverage knowledge across domains and learn general purpose representations. Nevertheless, they can fail to live up to these promises as tasks often compete for a model's limited resources, potentially leading to lower overall performance. In this work we tackle the issue of interfering tasks through a comprehensive analysis of their training, derived from looking at the interaction between gradients within their shared parameters. Our empirical results show that well-performing models have low variance in the angles between task gradients and that popular regularization methods implicitly reduce this measure. Based on this observation, we propose a novel gradient regularization term that minimizes task interference by enforcing near orthogonal gradients. Updating the shared parameters using this property encourages task specific decoders to optimize different parts of the feature extractor, thus reducing competition. We evaluate our method with classification and regression tasks on the multiDigitMNIST, NYUv2 and SUN RGB-D datasets where we obtain competitive results.

Includes members:
  Member "meta learning representations for continual learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online fast adaptation and knowledge accumulation a new approach to continual learning")
  Member "which tasks should be learned together in multi task learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "on the variance of the adaptive learning rate and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "branched multi task networks deciding what layers to share":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "a modulation module for multi task learning with applications in image retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  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 "end to end multi task learning with attention":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "multi task learning as multi objective optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mti net multi scale task interaction networks for multi task 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)