Masked Vector Quantization

Generative models with discrete latent representations have recently demonstrated an impressive ability to learn complex high-dimensional data distributions. However, their performance relies on a long sequence of tokens per instance and a large number of codebook entries, resulting in long sampling...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Nguyen, David D, Leibowitz, David, Nepal, Surya, Kanhere, Salil S
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 25.03.2024
Subjects
Representations
Sampling
Vector quantization
Online AccessGet full text

Cover

More Information
Summary:Generative models with discrete latent representations have recently demonstrated an impressive ability to learn complex high-dimensional data distributions. However, their performance relies on a long sequence of tokens per instance and a large number of codebook entries, resulting in long sampling times and considerable computation to fit the categorical posterior. To address these issues, we propose the Masked Vector Quantization (MVQ) framework which increases the representational capacity of each code vector by learning mask configurations via a stochastic winner-takes-all training regime called Multiple Hypothese Dropout (MH-Dropout). On ImageNet 64\(\times\)64, MVQ reduces FID in existing vector quantization architectures by up to \(68\%\) at 2 tokens per instance and \(57\%\) at 5 tokens. These improvements widen as codebook entries is reduced and allows for \(7\textit{--}45\times\) speed-up in token sampling during inference. As an additional benefit, we find that smaller latent spaces lead to MVQ identifying transferable visual representations where multiple can be smoothly combined.
ISSN:2331-8422