-
Notifications
You must be signed in to change notification settings - Fork 223
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[feature] Finite Scalar Quantization: VQ-VAE Made Simple #72
Comments
@kashif nice! you are really on top of the vector quantization literature 😄 yea, i can probably add this as a separate file |
@kashif i'm guessing because this is a deepmind work, no code will be available |
oh i just saw the appendix.. the code in jax is there... nice! |
@kashif woohoo! see if chatgpt can translate it to pytorch 😆 |
if not, that's ok, i'll just do it tomorrow morning, seems very straightforward |
fixed by #74 |
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.
See paper https://arxiv.org/abs/2309.15505
Will read over it and see how to add it
The text was updated successfully, but these errors were encountered: