human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "haq hardware aware automated quantization with mixed precision"
  Abstract: Model quantization is a widely used technique to compress and accelerate deep neural network (DNN) inference. Emergent DNN hardware accelerators begin to support mixed precision (1-8 bits) to further improve the computation efficiency, which raises a great challenge to find the optimal bitwidth for each layer: it requires domain experts to explore the vast design space trading off among accuracy, latency, energy, and model size, which is both time-consuming and sub-optimal. Conventional quantization algorithm ignores the different hardware architectures and quantizes all the layers in a uniform way. In this paper, we introduce the Hardware-Aware Automated Quantization (HAQ) framework which leverages the reinforcement learning to automatically determine the quantization policy, and we take the hardware accelerator's feedback in the design loop. Rather than relying on proxy signals such as FLOPs and model size, we employ a hardware simulator to generate direct feedback signals (latency and energy) to the RL agent. Compared with conventional methods, our framework is fully automated and can specialize the quantization policy for different neural network architectures and hardware architectures. Our framework effectively reduced the latency by 1.4-1.95x and the energy consumption by 1.9x with negligible loss of accuracy compared with the fixed bitwidth (8 bits) quantization. Our framework reveals that the optimal policies on different hardware architectures (i.e., edge and cloud architectures) under different resource constraints (i.e., latency, energy and model size) are drastically different. We interpreted the implication of different quantization policies, which offer insights for both neural network architecture design and hardware architecture design.

Connected through hyperedge HE-1 (induced by source paper "gan compression efficient architectures for interactive conditional gans"):
  with members:
    - "learning character agnostic motion for motion retargeting in 2d"
    - "design automation for efficient deep learning computing"
    - "searching for mobilenetv3"
    - "single path one shot neural architecture search with uniform sampling"
    - "semantic image synthesis with spatially adaptive normalization"
    - "co evolutionary compression for unpaired image translation"
    - "compressing gans using knowledge distillation"
    - "video to video synthesis"

Connected through hyperedge HE-2 (induced by source paper "learning architectures for binary networks"):
  with members:
    - "random search and reproducibility for neural architecture search"
    - "circulant binary convolutional networks enhancing the performance of 1 bit dcnns with circulant back propagation"
    - "binarized neural architecture search"
    - "mobinet a mobile binary network for image classification"
    - "bayesian optimized 1 bit cnns"
    - "searching for a robust neural architecture in four gpu hours"
    - "exploring randomly wired neural networks for image recognition"
    - "xnor net improved binary neural networks"

Connected through hyperedge HE-3 (induced by source paper "switchable precision neural networks"):
  with members:
    - "knowledge adaptation for efficient semantic segmentation"
    - "adaptative inference cost with convolutional neural mixture models"
    - "universally slimmable networks and improved training techniques"
    - "autoslim towards one shot architecture search for channel numbers"
    - "be your own teacher improve the performance of convolutional neural networks via self distillation"
    - "once for all train one network and specialize it for efficient deployment on diverse hardware platforms"
    - "searching for accurate binary neural architectures"
    - "auxiliary learning for deep multi task learning"

Connected through hyperedge HE-4 (induced by source paper "group sparsity the hinge between filter pruning and decomposition for network compression"):
  with members:
    - "data free quantization through weight equalization and bias correction"
    - "3d appearance super resolution with deep learning"
    - "towards optimal structured cnn pruning via generative adversarial learning"
    - "oicsr out in channel sparsity regularization for compact deep neural networks"
    - "gasl guided attention for sparsity learning in deep neural networks"
    - "importance estimation for neural network pruning"
    - "learning filter basis for convolutional neural network compression"
    - "similarity preserving knowledge distillation"

Connected through hyperedge HE-5 (induced by source paper "efficient bitwidth search for practical mixed precision neural network"):
  with members:
    - "differentiable soft quantization bridging full precision and low bit neural networks"
    - "hawq hessian aware quantization of neural networks with mixed precision"
    - "regularized evolution for image classifier architecture search"
    - "lq nets learned quantization for highly accurate and compact deep neural networks"
    - "learning to quantize deep networks by optimizing quantization intervals with task loss"
    - "proxylessnas direct neural architecture search on target task and hardware"
    - "discrimination aware channel pruning for deep neural networks"
    - "releq an automatic reinforcement learning approach for deep quantization of neural networks"

Connected through hyperedge HE-6 (induced by source paper "fractional skipping towards finer grained dynamic cnn inference"):
  with members:
    - "scalable methods for 8 bit training of neural networks"
    - "slimmable neural networks"
    - "hybrid pruning thinner sparse networks for fast inference on edge devices"
    - "deep k means re training and parameter sharing with harder cluster assignments for compressing deep convolutions"
    - "gaternet dynamic filter selection in convolutional neural network via a dedicated global gating network"
    - "skipnet learning dynamic routing in convolutional networks"
    - "learning efficient convolutional networks through network slimming"
    - "quantization and training of neural networks for efficient integer arithmetic only inference"

Connected through hyperedge HE-7 (induced by source paper "channel pruning via automatic structure search"):
  with members:
    - "towards optimal structured cnn pruning via generative adversarial learning"
    - "play and prune adaptive filter pruning for deep model compression"
    - "cop customized deep model compression via regularized correlation based filter level pruning"
    - "netadapt platform aware neural network adaptation for mobile applications"
    - "autopruner an end to end trainable filter pruning method for efficient deep model inference"
    - "amc automl for model compression and acceleration on mobile devices"
    - "the lottery ticket hypothesis finding sparse trainable neural networks"
    - "soft filter pruning for accelerating deep convolutional neural networks"

Connected through hyperedge HE-8 (induced by source paper "post training quantization with multiple points mixed precision without mixed precision"):
  with members:
    - "data free quantization through weight equalization and bias correction"
    - "improving neural network quantization without retraining using outlier channel splitting"
    - "additive powers of two quantization a non uniform discretization for neural networks"
    - "loss aware post training quantization"
    - "low bit quantization of neural networks for efficient inference"
    - "same same but different recovering neural network quantization error through weight factorization"
    - "hawq hessian aware quantization of neural networks with mixed precision"
    - "quantizing deep convolutional networks for efficient inference a whitepaper"

Question: Please tell me which class the center node 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)