MLCVITLGJun 17, 2020

Universally Quantized Neural Compression

arXiv:2006.09952v2107 citations
AI Analysis

This work addresses a practical problem in neural compression for researchers and practitioners by eliminating training-test mismatch, though it is incremental as it builds on existing uniform noise methods.

The paper tackles the mismatch between training and test phases in neural compression by using universal quantization to implement a uniform noise channel at test time, maintaining a differentiable loss function and showing that quantization can be derived as a limiting case of this approach.

A popular approach to learning encoders for lossy compression is to use additive uniform noise during training as a differentiable approximation to test-time quantization. We demonstrate that a uniform noise channel can also be implemented at test time using universal quantization (Ziv, 1985). This allows us to eliminate the mismatch between training and test phases while maintaining a completely differentiable loss function. Implementing the uniform noise channel is a special case of the more general problem of communicating a sample, which we prove is computationally hard if we do not make assumptions about its distribution. However, the uniform special case is efficient as well as easy to implement and thus of great interest from a practical point of view. Finally, we show that quantization can be obtained as a limiting case of a soft quantizer applied to the uniform noise channel, bridging compression with and without quantization.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes