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,742 papers · 148 categories

Trend · papers per month

4284125167 · Jun 202019922001200920172026
48 results for vector quantization

We present Rotated Adaptive Tetra-iterated Quantizer (RATQ), a fixed-length quantizer for gradients in first order stochastic optimization. RATQ is easy to implement and involves only a Hadamard transform computation and adaptive uniform quantization with appropriately chosen dynamic ranges. For noisy gradients with al…

2019-08-22abs ↗pdf ↗

A simple and computationally efficient scheme for tree-structured vector quantization is presented. Unlike previous methods, its quantization error depends only on the intrinsic dimension of the data distribution, rather than the apparent dimension of the space in which the data happen to lie.

2008-05-09abs ↗pdf ↗

Quantizes Kähler manifolds using sheaves and differential operators.

problem Quantizing Kähler manifolds with sheaves and differential operators.
method Constructing a category enriched over sheaves of modules, defining quantizable morphisms, and showing equivalence to differential operator categories.
result Equivalence of quantized categories under certain conditions.

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.

Inverted file and asymmetric distance computation (IVFADC) have been successfully applied to approximate nearest neighbor search and subsequently maximum inner product search. In such a framework, vector quantization is used for coarse partitioning while product quantization is used for quantizing residuals. In the ori…

2019-03-25abs ↗pdf ↗

Vectors of data are at the heart of machine learning and data mining. Recently, vector quantization methods have shown great promise in reducing both the time and space costs of operating on vectors. We introduce a vector quantization algorithm that can compress vectors over 12x faster than existing techniques while al…

2017-06-30abs ↗pdf ↗

Note on subgaussian bounds for sign-quantized linear maps.

problem Understanding subgaussian behavior of sign-quantized linear maps.
method Developed a dimension-independent subgaussian concentration bound for Gaussian vectors under nonlinear mappings.
result Answered a question about sign-quantized linear maps using a new subgaussian bound.

A new framework for neural network classification using vector quantization.

problem Learning a neural network classifier under the IB principle.
method Aggregated Learning framework, combining vector quantization and variational techniques.
result The effectiveness of Aggregated Learning verified through experiments.

Post-training quantization method using multiple low-precision points achieves higher precision for critical weights.

problem Discretizing pre-trained deep neural networks without re-training.
method Multipoint quantization with efficient greedy selection and adaptive point number.
result Outperforms state-of-the-art methods on ImageNet classification and PASCAL VOC object detection.

A new method for robust product Markovian quantization overcomes numerical instabilities.

problem Numerical instabilities in the PMQ algorithm limit its adoption, especially for stochastic volatility models.
method Reformulated PMQ as standard vector quantization, applying accelerated Lloyd's algorithm for robustness.
result The method overcomes numerical instabilities and extends applicability to stochastic volatility models.

The paper examines obstacles to extending deformation quantization of vector bundles.

problem Obstructing the extension of deformation quantization to higher orders.
method Analyzes the obstruction class and proves its necessity and sufficiency under certain conditions.
result Establishes that extending deformation quantization to higher orders is possible under specific conditions.

A new distortion measure optimizes function approximations in vector quantization.

problem Measuring the quality of vector quantization points for natural signals.
method A canonical distortion measure (CDM) is introduced, induced by an environment of functions on input space.
result Optimizing reconstruction error with respect to CDM yields optimal piecewise constant approximations.

New method classifies manifold-valued data using Riemannian geometry.

problem Classifying data on curved Riemannian manifolds.
method Probabilistic Learning Vector Quantization on Symmetric Positive Definite Matrices.
result The method outperforms traditional Euclidean methods on manifold-valued data.

A geometric quantization of a Kähler manifold, viewed as a symplectic manifold, depends on the complex structure compatible with the symplectic form. The quantizations form a vector bundle over the space of such complex structures. Having a canonical quantization would amount to finding a natural (projectively) flat co…

1997-03-18abs ↗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.

We propose a quantization based approach for fast approximate Maximum Inner Product Search (MIPS). Each database vector is quantized in multiple subspaces via a set of codebooks, learned directly by minimizing the inner product quantization error. Then, the inner product of a query to a database vector is approximated …

2015-09-04abs ↗pdf ↗

The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.

problem Clustering concatenated noisy vectors from multiple sources.
method Asymptotic analysis of weighted sum of distances to a common cluster center.
result The clustering approach outperforms naive methods in terms of average distortion.

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.

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.

Study shows simple vector quantization measures correlate with deep learning generalization.

problem Understanding and predicting generalization in deep learning models.
method Applying complexity measures from approximation and information theory to deep learning features.
result Simple vector quantization measures correlate well with generalization performance in deep learning.

Let (E,h)(E,h) be a holomorphic Hermitian vector bundle over a polarized manifold. We provide a canonical quantization of the Laplacian operator acting on sections of the bundle of Hermitian endomorphisms of EE. If EE is simple we obtain an approximation of the eigenvalues and eigenspaces of the Laplacian.

2015-05-14abs ↗pdf ↗

By computing certain cohomology of Vect(M) of smooth vector fields we prove that on 1-dimensional manifolds M there is no quantization map intertwining the action of non-projective embeddings of the Lie algebra sl(2) into the Lie algebra Vect(M). Contrariwise, for projective embeddings sl(2)-equivariant quantization ex…

2006-01-14abs ↗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 ↗

In this work we present a review of the state of the art of Learning Vector Quantization (LVQ) classifiers. A taxonomy is proposed which integrates the most relevant LVQ approaches to date. The main concepts associated with modern LVQ approaches are defined. A comparison is made among eleven LVQ classifiers using one r…

2015-09-23abs ↗pdf ↗

We adapt the framework of geometric quantization to the polysymplectic setting. Considering prequantization as the extension of symmetries from an underlying polysymplectic manifold to the space of sections of a Hermitian vector bundle, a natural definition of prequantum vector bundle is obtained which incorporates in …

2019-05-30abs ↗pdf ↗

This paper compresses neural networks by permuting and quantizing weights.

problem Efficiently compressing large neural networks for resource-constrained platforms.
method Permuting and quantizing weights, connecting to rate-distortion theory, and using annealed quantization.
result Significant compression with minimal accuracy loss, e.g., 40-70% reduction in gap with uncompressed model.

In the first part of this article we provide a geometrically oriented approach to the theory of orbispaces which originally had been introduced by Chen. We explain the notion of a vector orbibundle and characterize the good sections of a reduced vector orbibundle as the smooth stratified sections. In the second part of…

2002-08-14abs ↗pdf ↗

VQ-GNN scales GNNs to large graphs using vector quantization.

problem Scaling GNNs to large graphs with stable performance and speed.
method VQ-GNN uses vector quantization to preserve all messages passed to a mini-batch of nodes, avoiding the 'neighbor explosion' problem.
result VQ-GNN achieves competitive performance on large-graph node classification and link prediction benchmarks.

In this paper, we provide an information-theoretic interpretation of the Vector Quantized-Variational Autoencoder (VQ-VAE). We show that the loss function of the original VQ-VAE can be derived from the variational deterministic information bottleneck (VDIB) principle. On the other hand, the VQ-VAE trained by the Expect…

2018-08-02abs ↗pdf ↗

We discuss the quantization of mechanical systems for which the Hamiltonian vector fields of observables form the deformation of nn-dimensional oscilator algebra. Because of this fact these systems can be considered as "deformations" of the harmonic oscillator. The set of abovementioned mechanical systems are realized…

1995-08-04abs ↗pdf ↗

Paper proves existence of a universal codebook for low-precision quantization.

problem Optimizing low-precision approximation of matrix products in machine learning.
method Develops a universal codebook that is near-optimal for all possible statistics of input data.
result Proves existence of a universal codebook with a 0.11 bit per dimension reduction in rate.

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.

Study quantizes topological numbers on degenerating Einstein manifolds.

problem Quantizing topological numbers on non-collapsed degenerating Einstein manifolds.
method Compactness theory of bubbles, classical vanishing theorems, and Hirzebruch-Riemann-Roch theorems.
result Established quantization results for various topological numbers.

This work reduces model size by 86.11% for recommender systems using 4-bit quantization.

problem Large memory consumption in embedding vectors for recommender systems.
method Post-training 4-bit quantization on embedding tables, including row-wise uniform quantization and codebook-based quantization.
result Consistently reduces accuracy degradation while significantly reducing model size.

Quantization can be used to form new vectors/matrices with shared values close to the original. In recent years, the popularity of scalar quantization for value-sharing applications has been soaring as it has been found huge utilities in reducing the complexity of neural networks. Existing clustering-based quantization…

2018-03-01abs ↗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.

We propose and study a multi-scale approach to vector quantization. We develop an algorithm, dubbed reconstruction trees, inspired by decision trees. Here the objective is parsimonious reconstruction of unsupervised data, rather than classification. Contrasted to more standard vector quantization methods, such as K-mea…

2019-07-08abs ↗pdf ↗