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 "pareto multi task learning"):
  Abstract: Multi-task learning is a powerful method for solving multiple correlated tasks simultaneously. However, it is often impossible to find one single solution to optimize all the tasks, since different tasks might conflict with each other. Recently, a novel method is proposed to find one single Pareto optimal solution with good trade-off among different tasks by casting multi-task learning as multiobjective optimization. In this paper, we generalize this idea and propose a novel Pareto multi-task learning algorithm (Pareto MTL) to find a set of well-distributed Pareto solutions which can represent different trade-offs among different tasks. The proposed algorithm first formulates a multi-task learning problem as a multiobjective optimization problem, and then decomposes the multiobjective optimization problem into a set of constrained subproblems with different trade-off preferences. By solving these subproblems in parallel, Pareto MTL can find a set of well-representative Pareto optimal solutions with different trade-off among all tasks. Practitioners can easily select their preferred solution from these Pareto solutions, or use different trade-off solutions for different situations. Experimental results confirm that the proposed algorithm can generate well-representative solutions and outperform some state-of-the-art algorithms on many multi-task learning applications.

Includes members:
  Member "which tasks should be learned together in multi task learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "the apolloscape open dataset for autonomous driving and its application":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted average precision adversarial example detection in the visual perception of autonomous vehicles")
  Member "dpp net device aware progressive search for pareto optimal neural architectures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "taskonomy disentangling task transfer learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "proxylessnas direct neural architecture search on target task and hardware":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "dels 3d deep localization and segmentation with a 3d semantic map":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "da4ad end to end deep attention aware features aided visual localization for autonomous driving")
  Member "multi task learning as multi objective optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "learning general purpose distributed sentence representations via large scale multi task learning":
    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)