TensorX
返回文献探索

Paper · arXiv 2309.15505

Finite Scalar Quantization: VQ-VAE Made Simple

Fabian Mentzer, David Minnen, Eirikur Agustsson, Michael Tschannen

24 upvotesSeptember 27, 2023arXiv 预印本
AI 摘要

The proposed finite scalar quantization (FSQ) for VAE latent representations offers competitive performance in image generation and other vision tasks without the complexity of VQ.

vector quantizationfinite scalar quantizationVQ-VAEsautoregressive modelsmasked transformer modelsimage generationmultimodal generationdense predictionMaskGITUViMdepth estimationcolorizationpanoptic segmentationcodebook collapse

Abstract

We propose to replace vector quantization (VQ) in the latent representation of VQ-VAEs with a simple scheme termed finite scalar quantization (FSQ), where we project the VAE representation down to a few dimensions (typically less than 10). Each dimension is quantized to a small set of fixed values, leading to an (implicit) codebook given by the product of these sets. By appropriately choosing the number of dimensions and values each dimension can take, we obtain the same codebook size as in VQ. On top of such discrete representations, we can train the same models that have been trained on VQ-VAE representations. For example, autoregressive and masked transformer models for image generation, multimodal generation, and dense prediction computer vision tasks. Concretely, we employ FSQ with MaskGIT for image generation, and with UViM for depth estimation, colorization, and panoptic segmentation. Despite the much simpler design of FSQ, we obtain competitive performance in all these tasks. We emphasize that FSQ does not suffer from codebook collapse and does not need the complex machinery employed in VQ (commitment losses, codebook reseeding, code splitting, entropy penalties, etc.) to learn expressive discrete representations.

北京市昌平区探索星信息技术及软件开发工作室

京ICP备2026059466号
Finite Scalar Quantization: VQ-VAE Made Simple | TensorX