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 "rate distortion for model compression from theory to practice"):
  Abstract: The enormous size of modern deep neural networks makes it challenging to deploy those models in memory and communication limited scenarios. Thus, compressing a trained model without a significant loss in performance has become an increasingly important task. Tremendous advances has been made recently, where the main technical building blocks are parameter pruning, parameter sharing (quantization), and low-rank factorization. In this paper, we propose principled approaches to improve upon the common heuristics used in those building blocks, namely pruning and quantization. #R##N#We first study the fundamental limit for model compression via the rate distortion theory. We bring the rate distortion function from data compression to model compression to quantify this fundamental limit. We prove a lower bound for the rate distortion function and prove its achievability for linear models. Although this achievable compression scheme is intractable in practice, this analysis motivates a novel model compression framework. This framework provides a new objective function in model compression, which can be applied together with other classes of model compressor such as pruning or quantization. Theoretically, we prove that the proposed scheme is optimal for compressing one-hidden-layer ReLU neural networks. Empirically, we show that the proposed scheme improves upon the baseline in the compression-accuracy tradeoff.

Includes members:
  Member "amc automl for model compression and acceleration on mobile devices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learning one hidden layer neural networks with landscape design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "backward feature correction how deep learning performs deep learning")
  Member "on calibration of modern neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatiotemporal relationship reasoning for pedestrian intent prediction")
  Member "mobilenets efficient convolutional neural networks for mobile vision applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "towards the limit of network quantization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "trends and advancements in deep neural network communication")
  Member "google s neural machine translation system bridging the gap between human and machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "deep compression compressing deep neural networks with pruning trained quantization and huffman coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learning both weights and connections for efficient 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.IT(Information Theory)