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 "mixed precision quantized neural network with progressively decreasing bitwidth for image classification and object detection"):
  Abstract: Efficient model inference is an important and practical issue in the deployment of deep neural network on resource constraint platforms. Network quantization addresses this problem effectively by leveraging low-bit representation and arithmetic that could be conducted on dedicated embedded systems. In the previous works, the parameter bitwidth is set homogeneously and there is a trade-off between superior performance and aggressive compression. Actually the stacked network layers, which are generally regarded as hierarchical feature extractors, contribute diversely to the overall performance. For a well-trained neural network, the feature distributions of different categories differentiate gradually as the network propagates forward. Hence the capability requirement on the subsequent feature extractors is reduced. It indicates that the neurons in posterior layers could be assigned with lower bitwidth for quantized neural networks. Based on this observation, a simple but effective mixed-precision quantized neural network with progressively ecreasing bitwidth is proposed to improve the trade-off between accuracy and compression. Extensive experiments on typical network architectures and benchmark datasets demonstrate that the proposed method could achieve better or comparable results while reducing the memory space for quantized parameters by more than 30\% in comparison with the homogeneous counterparts. In addition, the results also demonstrate that the higher-precision bottom layers could boost the 1-bit network performance appreciably due to a better preservation of the original image information while the lower-precision posterior layers contribute to the regularization of $k-$bit networks.

Includes members:
  Member "understanding straight through estimator in training activation quantized neural nets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deformation aware unpaired image translation for pose estimation on laboratory animals")
  Member "efficientnet rethinking model scaling for convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "learned step size quantization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ordering chaos memory aware scheduling of irregularly wired neural networks for edge devices")
  Member "bi real net enhancing the performance of 1 bit cnns with improved representational capability and advanced training algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning architectures for binary networks")
  Member "the lottery ticket hypothesis finding sparse trainable neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lossless compression of deep neural networks")
  Member "haq hardware aware automated quantization with mixed precision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "training competitive binary neural networks from scratch":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "meliusnet can binary neural networks achieve mobilenet level accuracy")
  Member "pact parameterized clipping activation for quantized 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.CV(Computer Vision and Pattern Recognition)