Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

146291437582 · Jun 202019922001200920172026
48 results for quantized latent space

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 …

2019-05-27abs ↗pdf ↗

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…

2019-03-11abs ↗pdf ↗

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.

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…

2018-06-08abs ↗pdf ↗

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…

2018-10-12abs ↗pdf ↗

Despite progress in training neural networks for lossy image compression, current approaches fail to maintain both perceptual quality and abstract features at very low bitrates. Encouraged by recent success in learning discrete representations with Vector Quantized Variational Autoencoders (VQ-VAEs), we motivate the us…

2020-02-19abs ↗pdf ↗

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…

2018-11-12abs ↗pdf ↗

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.

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.

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.

We propose a novel algorithm for quantizing continuous latent representations in trained models. Our approach applies to deep probabilistic models, such as variational autoencoders (VAEs), and enables both data and model compression. Unlike current end-to-end neural compression methods that cater the model to a fixed q…

2020-02-18abs ↗pdf ↗

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.

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…

2018-05-28abs ↗pdf ↗

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.

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.

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…

2001-06-01abs ↗pdf ↗

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…

1996-08-17abs ↗pdf ↗

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…

1996-09-30abs ↗pdf ↗

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…

2000-05-31abs ↗pdf ↗

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…

1997-09-17abs ↗pdf ↗

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…

2019-06-02abs ↗pdf ↗

This work is a contribution to the area of Strict Quantization (in the sense of Rieffel) in the presence of curvature and non-Abelian group actions. More precisely, we use geometry to obtain explicit oscillatory integral formulae for strongly invariant strict deformation quantizations of a class of solvable symplectic …

2000-10-01abs ↗pdf ↗