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 "good subnetworks provably exist pruning via greedy forward selection"):
  Abstract: Recent empirical works show that large deep neural networks are often highly redundant and one can find much smaller subnetworks without a significant drop of accuracy. However, most existing methods of network pruning are empirical and heuristic, leaving it open whether good subnetworks provably exist, how to find them efficiently, and if network pruning can be provably better than direct training using gradient descent. We answer these problems positively by proposing a simple greedy selection approach for finding good subnetworks, which starts from an empty network and greedily adds important neurons from the large network. This differs from the existing methods based on backward elimination, which remove redundant neurons from the large network. Theoretically, applying our greedy selection strategy on sufficiently large pre-trained networks guarantees to find small subnetworks with lower loss than networks directly trained with gradient descent. Practically, we improve prior arts of network pruning on learning compact neural architectures on ImageNet, including ResNet, MobilenetV2/V3, and ProxylessNet. Our theory and empirical results on MobileNet suggest that we should fine-tune the pruned subnetworks to leverage the information from the large model, instead of re-training from new random initialization as suggested in \citet{liu2018rethinking}.

Includes members:
  Member "proving the lottery ticket hypothesis pruning is all you need":
    also connected through other hyperedges:
      (none)
  Member "pruning from scratch":
    also connected through other hyperedges:
      (none)
  Member "sipping neural networks sensitivity informed provable pruning of neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "provable filter pruning for efficient neural networks")
  Member "searching for mobilenetv3":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "data independent neural pruning via coresets":
    also connected through other hyperedges:
      (none)
  Member "legr filter pruning via learned global ranking":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pops policy pruning and shrinking for deep reinforcement learning")
  Member "what s hidden in a randomly weighted neural network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on pruning adversarially robust neural networks")
  Member "provable filter pruning for efficient neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on coresets for support vector machines")

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)