Rethinking Data-Free Quantization as a Zero-Sum Game
Biao Qian, Yang Wang, Richang Hong, Meng Wang

TL;DR
This paper introduces a game-theoretic approach to data-free quantization, focusing on generating adaptable samples to improve quantized network performance without real data.
Contribution
It formulates data-free quantization as a zero-sum game and proposes AdaSG, a method that dynamically generates samples with desirable adaptability to enhance quantization.
Findings
AdaSG outperforms state-of-the-art methods.
Theoretical analysis supports the effectiveness of the game approach.
Empirical results show improved accuracy in quantized networks.
Abstract
Data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing the real data, but generates the fake sample via a generator (G) by learning from full-precision network (P) instead. However, such sample generation process is totally independent of Q, specialized as failing to consider the adaptability of the generated samples, i.e., beneficial or adversarial, over the learning process of Q, resulting into non-ignorable performance loss. Building on this, several crucial questions -- how to measure and exploit the sample adaptability to Q under varied bit-width scenarios? how to generate the samples with desirable adaptability to benefit the quantized network? -- impel us to revisit DFQ. In this paper, we answer the above questions from a game-theory perspective to specialize DFQ as a zero-sum game between two players -- a generator and a quantized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Sparse and Compressive Sensing Techniques · Advanced Image Processing Techniques
