GLAD improves latent graph generation by quantizing discrete latent space.
problem Latent space graph generative models lack performance and make unnatural assumptions.
method Adapting diffusion bridges to a discrete latent space, avoiding data space decompositions.
result GLAD achieves competitive performance on graph benchmark datasets.
Quantizes latent space to improve disentanglement in models.
problem Learning disentangled representations from unlabeled data.
method Quantizes latent space into discrete code vectors with a learnable scalar codebook and applies high weight decay regularization.
result Quantized-latent autoencoder (QLAE) outperforms prior work in disentanglement without sacrificing data reconstruction.
A new method for multiclass calibration using vector quantization.
problem Challenges in multiclass calibration, especially in high-stakes settings.
method Compositional approach via Vector Quantization (VQ) to learn region-specific calibration maps.
result Significant improvements in local calibration with competitive global calibration and predictive performance.
Autoencoders and their variations provide unsupervised models for learning low-dimensional representations for downstream tasks. Without proper regularization, autoencoder models are susceptible to the overfitting problem and the so-called posterior collapse phenomenon. In this paper, we introduce a quantization-based …
Improves naturalness in TTS samples using quantized VAE and auto-regressive prosody.
problem Discontinuous and unnatural speech from standard VAE priors.
method Discretized latent features using vector quantization (VQ), and separately trained autoregressive (AR) prior model.
result Significantly improves naturalness in random sample generation.
In this work, a deep learning-based method for log-likelihood ratio (LLR) lossy compression and quantization is proposed, with emphasis on a single-input single-output uncorrelated fading communication setting. A deep autoencoder network is trained to compress, quantize and reconstruct the bit log-likelihood ratios cor…
For a robot to perform complex manipulation tasks, it is necessary for it to have a good grasping ability. However, vision based robotic grasp detection is hindered by the unavailability of sufficient labelled data. Furthermore, the application of semi-supervised learning techniques to grasp detection is under-explored…
Improved vector quantization using Gaussian mixtures for better codebook utilization.
problem Training instability and information loss in discrete vector quantization.
method Generalized vector quantization with Gaussian mixture model and aggregated categorical posterior evidence lower bound.
result GM-VQ improves codebook utilization and reduces information loss without heuristics.
PRISM-VQ combines financial priors with vector quantization for better stock prediction.
problem Predicting cross-sectional stock returns is hard due to low signal-to-noise ratios and changing market conditions.
method Integrates expert priors, vector-quantized latent factors, and dynamic factor loadings.
result Consistent improvements in cross-sectional return prediction and portfolio performance.
New hierarchical VQ-VAE scheme improves image compression quality and features at low bitrates.
problem Low bitrate image compression maintaining quality and features.
method Hierarchical VQ-VAE with stochastic quantization and Markovian latent variables.
result High perceptual quality and semantic features at low bitrates.
Optimal quantization improves dataset distillation for faster training.
problem Efficiently train models with synthetic data.
method Reformulate disentangled methods as optimal quantization problems.
result Better performance and generalization on ImageNet-1K and subsets.
Paper proposes a new Autoencoder for robustly encoding white matter streamlines.
problem Limited Autoencoder architectures ignore global streamline geometry and lack interpretability.
method Introduces Differentiable Vector Quantized Variational Autoencoder (D-VQ-VAE) for entire streamline bundles.
result Demonstrates superior performance in encoding and synthesis compared to state-of-the-art Autoencoders.
Discretizing multi-dimensional data distributions is a fundamental step of modern indexing methods. State-of-the-art techniques learn parameters of quantizers on training data for optimal performance, thus adapting quantizers to the data. In this work, we propose to reverse this paradigm and adapt the data to the quant…
A new algorithm for compressing latent representations in deep models.
problem Compressing continuous latent representations in deep models.
method Separates model design and training from quantization; uses adaptive quantization based on posterior uncertainty.
result Image compression with the proposed algorithm outperforms JPEG over a wide range of bit rates.
High-risk domains require reliable confidence estimates from predictive models. Deep latent variable models provide these, but suffer from the rigid variational distributions used for tractable inference, which err on the side of overconfidence. We propose Stochastic Quantized Activation Distributions (SQUAD), which im…
A new method learns discrete representations for images and videos, improving upon previous models.
problem Learning discrete representations for images and videos to improve performance.
method Depthwise application of Vector Quantized Variational Autoencoders (VQVAE) to feature axis.
result 33% improvement in performance compared to previous discrete models.
Generative AutoEncoders require a chosen probability distribution in latent space, usually multivariate Gaussian. The original Variational AutoEncoder (VAE) uses randomness in encoder - causing problematic distortion, and overlaps in latent space for distinct inputs. It turned out unnecessary: we can instead use determ…
Improved training for VQ-VAE models with robust codebook learning.
problem Challenges in training discrete latent variable models, especially VQ-VAEs.
method Increased learning rate and periodic re-initialization of codebook for robust training.
result More robust training and increased usage of latent codewords, even for large codebooks.
NM-VQTSG improves synthetic time series fidelity by aligning distributions.
problem Fidelity challenges in VQ-based time series generation.
method Neural mapping model using U-Net to refine synthetic data.
result Significant improvements in FID, IS, and conditional FID metrics.
QTD integrates quantization with diffusion for efficient data generation.
problem Challenges in continuous diffusion models, especially long-range transitions and biases.
method Quantized Transition Diffusion (QTD) integrates data quantization with discrete diffusion dynamics.
result QTD achieves efficient data generation with minimal score evaluations.
We propose a new Quantization algorithm for the approximation of inhomogeneous random walks, which are the key terms for the valuation of CDO-tranches in latent factor models. This approach is based on a dual quantization operator which posses an intrinsic stationarity and therefore automatically leads to a second orde…
SOM-VQ tokenizes discrete models with semantic structure and navigable topology.
problem Lack of semantic structure in vector quantized representations limits interpretable human control.
method Combines vector quantization with Self-Organizing Maps to learn discrete codebooks with explicit topology.
result SOM-VQ produces more learnable token sequences and provides an explicit navigable geometry in code space.
Quantization-aware training can recover accuracy lost by post-training quantization.
problem Post-training quantization (PTQ) can fail sharply at aggressive bitwidths.
method A unified geometric framework that explains PTQ failure and QAT recovery.
result QAT has a useful bias that steers iterates back into the basin.
A new model trains prior and encoder/decoder networks simultaneously for efficient generation.
problem Complex autoregressive prior in VQ-VAE models leads to slow generation.
method Builds a diffusion bridge between continuous and non-informative prior distributions.
result Model is competitive and efficient in optimization and sampling.
The article defines and compares two types of quantizations on compact manifolds.
problem Quantization on arbitrary compact smooth manifolds.
method Embedding into CP^n and inducing quantizations from there.
result Generalizations of earlier quantization methods.
A new method for unsupervised disentanglement using axis-aligned cliffs.
problem Unsupervised disentanglement of latent factors under nonlinear maps.
method Encouraging axis-aligned discontinuities (cliffs) in the estimated density of factors.
result Cliff method outperforms baselines on disentanglement benchmarks.
Deep neural networks with discrete latent variables offer the promise of better symbolic reasoning, and learning abstractions that are more useful to new tasks. There has been a surge in interest in discrete latent variable models, however, despite several recent improvements, the training of discrete latent variable m…
Improved neural image compression with refined latent representations.
problem Sub-optimal results from variational autoencoders due to imperfect optimization and capacity limitations.
method Stochastic Gumbel Annealing (SGA) and its extensions (SGA+), including three different methods.
result Significant improvement in compression performance, especially on the R-D trade-off.
VQ-DRAW compresses images and generates realistic samples.
problem Learning compact discrete representations of images.
method Sequential discrete VAE with vector quantization.
result VQ-DRAW effectively compresses and generates images.
New method for quantizing symplectic manifolds with Lagrangian bundles.
problem Quantization of symplectic manifolds with Lagrangian bundles.
method A new construction of strict deformation quantization.
result Established a correspondence between differential operators and principal symbols.
This work analyzes VQ-VAEs using information theory, focusing on latent variables and their impact on generalization and data generation.
problem Lack of theoretical analysis for latent variables in unsupervised models like VQ-VAEs.
method Information-theoretic analysis, introducing a novel data-dependent prior.
result Derives a generalization error bound for VQ-VAEs that depends on LV complexity and encoder, not decoder.
Neural codec for high-fidelity audio compression.
problem Efficiently compress audio while maintaining high quality.
method End-to-end neural network architecture with quantized latent space, single multiscale spectrogram adversary, loss balancer mechanism, and lightweight Transformer compression.
result 40% compression with no loss in quality, faster than real-time.
Quantizes geodesics in Kähler and Sasaki geometry.
problem Quantize geodesics in Kähler and Sasaki spaces.
method Classical Fubini-Study map and quantization procedure.
result Proves conditions for geodesics in Kähler potentials.
Extends geometric quantization to singular spaces.
problem Handling singular symplectic spaces in geometric quantization.
method Developed stratified pseudobundles to replace auxiliary information.
result Provided results for singular quotients of toric manifolds and cotangent bundles.
Analyzes quantization of flux observables in gauge theories.
problem Lifting Poisson-brackets of flux observables to higher moduli stacks.
method Systematic analysis of canonical quantization and flux quantization laws.
result Topological quantum observables form homology Pontrjagin algebra of loop space.
The paper classifies quantizable functions and explores symmetry in quantization methods.
problem Classifying quantizable functions and understanding symmetry in quantization methods.
method Deformation quantization and geometric quantization methods are compared and classified.
result Formal quantizable functions are of a specific form and relate to Hamiltonian Killing vector fields.
This paper proposes a new way to quantize classical mechanical systems. Here we use ALAG - programme to construct moduli space of half weighted Bohr - Sommerfeld lagrangian cycles of fixed volume which is our quantum phase space. "Dynamical correspondence" principle makes possible to prove that this ALAG - quantization…
New method for flux quantization on phase space stacks.
problem Defining and constructing flux-quantized phase space stacks.
method Observation of flux densities and characterization of Cauchy data.
result Flux-quantized phase space stacks have classifying spaces with rational Whitehead L-infinity algebra.
We study two quantization schemes for compact symplectic manifolds with almost complex structures. The first of these is the Spin-c quantization. We prove the analog of Kodaira vanishing for the Spin-c Dirac operator, which shows that the index space of this operator provides an honest (not virtual) vector space semicl…
Estimates means in metric spaces using quantization.
problem No practical estimator for Fréchet means in all metric spaces.
method Introduced estimators based on random quantization and data-driven partitioning.
result Universal consistency of estimators across separable metric spaces and Banach spaces.
Quantizes geodesic lengths in Teichmüller spaces using algebraic methods.
problem Constructing quantized geodesic lengths for Teichmüller spaces.
method Developed quantum trace maps and investigated algebraic structures.
result Showed a recursion relation and commutation properties for quantized trace-of-monodromy.
We apply the geometric quantization method with real polarizations to the quantization of a symplectic torus. By quantizing with half-densities we canonically associate to the symplectic torus a projective Hilbert space and prove that the projective factor is expressible in terms of the Maslov-Kashiwara index. As in th…
Quantizes symplectic manifolds with bounded geometry using Berezin-Toeplitz method.
problem Quantization of symplectic manifolds with bounded geometry.
method Berezin-Toeplitz quantization theory.
result Correct semiclassical limit achieved.
We explore the use of Vector Quantized Variational AutoEncoder (VQ-VAE) models for large scale image generation. To this end, we scale and enhance the autoregressive priors used in VQ-VAE to generate synthetic samples of much higher coherence and fidelity than possible before. We use simple feed-forward encoder and dec…
By the quantization condition compact quantizable Kaehler manifolds can be embedded into projective space. In this way they become projective varieties. The quantum Hilbert space of the Berezin-Toeplitz quantization (and of the geometric quantization) is the projective coordinate ring of the embedded manifold. This all…
A unified approach to geometric, symbol and deformation quantizations on a generalized flag manifold endowed with an invariant pseudo-Kaehler structure is proposed. The Hilbert space of states is realized via the Bott-Borel-Weil theorem in the sheaf cohomology of the geometric quantization line bundle. The correspondin…
TimeVQVAE uses VQ for better time series generation.
problem Training GANs and RNNs for time series generation have limitations.
method Vector quantization with bidirectional transformer priors in time-frequency domains.
result Generates high-quality synthetic signals with better temporal consistency.
In the first part of the paper we describe the complex geometry of the universal Teichmüller space T, which may be realized as an open subset in the complex Banach space of holomorphic quadratic differentials in the unit disc. The quotient S of the diffeomorphism group of the circle modulo Möbius …