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 "disentangling redundancy for multi task pruning"):
  Abstract: Can prior network pruning strategies eliminate redundancy in multiple correlated pre-trained deep neural networks? It seems a positive answer if multiple networks are first combined and then pruned. However, we argue that an arbitrarily combined network may lead to sub-optimal pruning performance because their intra- and inter-redundancy may not be minimised at the same time while retaining the inference accuracy in each task. In this paper, we define and analyse the redundancy in multi-task networks from an information theoretic perspective, and identify challenges for existing pruning methods to function effectively for multi-task pruning. We propose Redundancy-Disentangled Networks (RDNets), which decouples intra- and inter-redundancy such that all redundancy can be suppressed via previous network pruning schemes. A pruned RDNet also ensures minimal computation in any subset of tasks, a desirable feature for selective task execution. Moreover, a heuristic is devised to construct an RDNet from multiple pre-trained networks. Experiments on CelebA show that the same pruning method on an RDNet achieves at least 1:8x lower memory usage and 1:4x lower computation cost than on a multi-task network constructed by the state-of-the-art network merging scheme.

Includes members:
  Member "branched multi task networks deciding what layers to share":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "multi task zipping via layer wise neuron sharing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "feature partitioning for efficient multi task architectures")
  Member "unifying and merging well trained deep neural networks for inference stage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "feature partitioning for efficient multi task architectures")
  Member "nestdnn resource aware multi tenant on device deep learning for continuous mobile vision":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mdldroid a chainsgd reduce approach to mobile deep learning for personal mobile sensing")
  Member "compressing neural networks using the variational information bottleneck":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "efficient processing of deep neural networks a tutorial and survey":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "searching for winograd aware quantized networks")
  Member "estimating mixture entropy with pairwise distances":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "understanding and enhancing mixed sample data augmentation")
  Member "learning structured sparsity in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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)