Information-theoretic Generalization Analysis for VQ-VAEs: A Role of Latent Variables
Not on the map. Why?
Abstract (arXiv)
Latent variables (LVs) play a crucial role in encoder-decoder models by enabling effective data compression, prediction, and generation. Although their theoretical properties, such as generalization, have been extensively studied in supervised learning, similar analyses for unsupervised models such as variational autoencoders (VAEs) remain insufficiently underexplored. In this work, we extend information-theoretic generalization analysis to vector-quantized (VQ) VAEs with discrete latent spaces, introducing a novel data-dependent prior to rigorously analyze the relationship among LVs, generalization, and data generation. We derive a novel generalization error bound of the reconstruction loss of VQ-VAEs, which depends solely on the complexity of LVs and the encoder, independent of the decoder. Additionally, we provide the upper bound of the 2-Wasserstein distance between the distributions of the true data and the generated data, explaining how the regularization of the LVs contributes to the data generation performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 44 of its 81 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
44 of 81 references.
References · 44
- 2017Neural Discrete Representation Learningcited by 4,712
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2016Deep Variational Information Bottleneckcited by 930
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2019On Mutual Information Maximization for Representation Learningcited by 316
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
- 2021Deep Generative Modelling: A Comparative Review of VAEs, GANs, Normalizing Flows, Energy-Based and Autoregressive Modelscited by 252
- 2017VAE with a VampPriorcited by 248
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 215
- 2019Rethinking Lossy Compression: The Rate-Distortion-Perception Tradeoffcited by 211
32 more
- 2020Reasoning About Generalization via Conditional Mutual Informationcited by 147
- 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 132
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 119
- 2023How Does Information Bottleneck Help Deep Learning?cited by 93
- 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
- 2017Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpointscited by 82
- 2018Generalization Error Bounds for Noisy, Iterative Algorithmscited by 82
- 2022SQ-VAE: Variational Bayes on Discrete Representation with Self-annealed Stochastic Quantizationcited by 68
- 2019On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learningcited by 57
- 2020Hierarchical Quantized Autoencoderscited by 57
- 2018Theory and Experiments on Vector Quantized Autoencoderscited by 55
- 2021Information-theoretic generalization bounds for black-box learning algorithmscited by 49
- 2021On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implicationscited by 31
- 2021PAC-Bayes Information Bottleneckcited by 28
- 2022A New Family of Generalization Bounds Using Samplewise Evaluated CMIcited by 28
- 2023Tighter Information-Theoretic Generalization Bounds from Supersamplescited by 22
- 2022On PAC-Bayesian reconstruction guarantees for VAEscited by 20
- 2022Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimizationcited by 19
- 2023Statistical Guarantees for Variational Autoencoders using PAC-Bayesian Theorycited by 16
- 2021Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channelscited by 15
- 2023Time-Independent Information-Theoretic Generalization Bounds for SGLDcited by 12
- 2013Moment-based Uniform Deviation Bounds for k-means and Friendscited by 11
- 2019Generalization Bounds For Unsupervised and Semi-Supervised Learning With Autoencoderscited by 11
- 2024Minimum Description Length and Generalization Guarantees for Representation Learningcited by 11
- 2013Efficient Classification for Metric Datacited by 10
- 2022Upper bounds on the Natarajan dimensions of some function classescited by 8
- 2023Recognizable Information Bottleneckcited by 5
- 2020The Role of Mutual Information in Variational Classifierscited by 3
- 2025Generalization Guarantees for Representation Learning via Data-Dependent Gaussian Mixture Priorscited by 2
- 2018Combinatorial and Structural Results for gamma-Psi-dimensionscited by 1
- 2025Multiview Representation Learning via Distributed Joint Latent Space Structuringcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026VP-VAE: Rethinking Vector Quantization via Adaptive Vector Perturbation
- 2025Generalization in VAE and Diffusion Models: A Unified Information-Theoretic Analysis
- 2024Gaussian Mixture Vector Quantization with Aggregated Categorical Posterior
- 2025Distillation of a tractable model from the VQ-VAE
- 2022Diffusion bridges vector quantized Variational AutoEncoders
- 2023A Note on Generalization in Variational Autoencoders: How Effective Is Synthetic Data & Overparameterization?
- 2023QARV: Quantization-Aware ResNet VAE for Lossy Image Compression
- 2024Balance of Number of Embedding and their Dimensions in Vector Quantization