vix.ing · top · new · best · stats

Enhancing Vector Quantization with Distributional Matching: A Theoretical and Empirical Study

2025/06/18 by Xianghong Fang, Fang, Xianghong, L. B. Guo +18 · 2 citations
Computer Science · #Advanced Data Compression Techniques #Code (set theory) #Codebook #Computer Vision and Pattern Recognition (cs.CV) #Empirical research #FOS: Computer and information sciences #Linde–Buzo–Gray algorithm #Machine Learning (cs.LG) #Neural Networks and Applications #Quantization (signal processing) #Source code #Vector quantization

paper · pdf · doi:10.48550/arxiv.2506.15078

published in arXiv (Cornell University) (Cornell University)

openalex publication_date 2025/06/18 · openalex created_date 2025/10/19 · openalex updated_date 2026/08/05

Abstract

The success of autoregressive models largely depends on the effectiveness of vector quantization, a technique that discretizes continuous features by mapping them to the nearest code vectors within a learnable codebook. Two critical issues in existing vector quantization methods are training instability and codebook collapse. Training instability arises from the gradient discrepancy introduced by the straight-through estimator, especially in the presence of significant quantization errors, while codebook collapse occurs when only a small subset of code vectors are utilized during training. A closer examination of these issues reveals that they are primarily driven by a mismatch between the distributions of the features and code vectors, leading to unrepresentative code vectors and significant data information loss during compression. To address this, we employ the Wasserstein distance to align these two distributions, achieving near 100% codebook utilization and significantly reducing the quantization error. Both empirical and theoretical analyses validate the effectiveness of the proposed approach.

Citations

Cited by

Related