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

Trend · papers per month

151302453604 · Jun 202019922001200920172026
48 results for quantized state

HMQ improves quantization for edge devices with mixed precision.

problem Efficient quantization for edge devices with uniform, power-of-two thresholds.
method Introduces HMQ, a mixed precision quantization block that repurposes Gumbel-Softmax for searching over quantization schemes.
result Achieves competitive and state-of-the-art results on ImageNet despite restrictions.

Unified finetuning of all quantization degrees of freedom achieves state-of-the-art 4-bit quantization.

problem Achieving high accuracy in quantized neural networks while maintaining speed and resource constraints.
method Quantization-aware finetuning (QFT) that jointly optimizes all quantization degrees of freedom.
result 4-bit weight quantization results on-par with state-of-the-art (SoTA) within PTQ constraints.

The paper defines and analyzes coherent and squeezed states on manifolds and their quantization.

problem Defining and characterizing coherent and squeezed states on various manifolds.
method Definition and analysis of Rawnsley-type coherent and squeezed states, Berezin quantization.
result Properties and quantization of coherent and squeezed states on manifolds.

LSQ+ improves quantization of neural nets with Swish activations, achieving state-of-the-art results.

problem Quantization of neural nets with Swish activations, especially negative activations, leads to significant performance loss.
method Introduces learnable scale and offset parameters for asymmetric quantization, and uses MSE-based initialization for quantization parameters.
result Significantly outperforms LSQ for low-bit quantization of neural nets with Swish activations, achieving up to 5.6% gain with W2A2 quantization of EfficientNet-B0.

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 ↗

LIQSS method improves accuracy and efficiency for power system simulations.

problem Accurately modeling and simulating long-duration mission profiles of Naval power systems.
method Linear Implicit Quantized State System (LIQSS) method for stiff, nonlinear, differential algebraic equations.
result LIQSS1 method yields results within 1% accuracy of continuous methods and increases efficiency logarithmically with quantization size.

In the paper we investigate a method of quantization based on the concept of positive definite kernel on a principal GG-bundle with compact structural group G. For G=U(1) our approach leads to Kostant-Souriau geometric quantization as well as to coherent state method of quantization. So, the theory proposed here can b…

2011-10-17abs ↗pdf ↗

To make deep neural networks feasible in resource-constrained environments (such as mobile devices), it is beneficial to quantize models by using low-precision weights. One common technique for quantizing neural networks is the straight-through gradient method, which enables back-propagation through the quantization ma…

2018-10-01abs ↗pdf ↗

DBQ quantizes lightweight networks efficiently for resource-constrained devices.

problem High computational and storage complexity of deep neural networks on resource-constrained devices.
method A differentiable non-uniform quantizer that can be mapped onto efficient ternary-based dot product engines.
result Achieves state-of-the-art results with minimal training overhead and best accuracy-complexity trade-off.

State-of-the-art neural machine translation methods employ massive amounts of parameters. Drastically reducing computational costs of such methods without affecting performance has been up to this point unsuccessful. To this end, we propose FullyQT: an all-inclusive quantization strategy for the Transformer. To the bes…

2019-10-17abs ↗pdf ↗

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 ↗

In this paper, we propose a new perspective for quantizing a signal and more specifically the channel state information (CSI). The proposed point of view is fully relevant for a receiver which has to send a quantized version of the channel state to the transmitter. Roughly, the key idea is that the receiver sends the r…

2019-04-02abs ↗pdf ↗

We extend quantization-aware training to extreme model compression.

problem Maximizing model accuracy with minimal model size.
method Quantize a random subset of weights during training, allowing unbiased gradients through other weights.
result Established new state-of-the-art compromises between accuracy and model size.

Adler had shown in 1979 that the Toda system can be given a coad- joint orbit description. We quantize the Toda system by viewing it as a single orbit of a multiplicative group of lower triangular matrices of determinant one with pos- itive diagonal entries. We get a unitary representation of the group with square inte…

2016-12-09abs ↗pdf ↗

New quantization methods improve accuracy of Random Fourier Features.

problem Improving accuracy of Random Fourier Features for machine learning.
method Sigma-Delta and distributed noise-shaping quantization methods for 1-bit and low bit-depth quantization.
result Quantized RFFs allow high accuracy approximation of underlying kernels with polynomial error decay.

QuantEase optimizes LLMs with CD-based quantization, achieving state-of-the-art performance.

problem Efficiently quantize large language models for deployment.
method Layer-wise quantization using CD-based algorithms with matrix and vector operations.
result State-of-the-art performance in perplexity and zero-shot accuracy.

Recent machine learning methods use increasingly large deep neural networks to achieve state of the art results in various tasks. The gains in performance come at the cost of a substantial increase in computation and storage requirements. This makes real-time implementations on limited resources hardware a challenging …

2019-02-18abs ↗pdf ↗

Although deep neural networks are highly effective, their high computational and memory costs severely challenge their applications on portable devices. As a consequence, low-bit quantization, which converts a full-precision neural network into a low-bitwidth integer version, has been an active and promising research t…

2019-11-21abs ↗pdf ↗

Continuous representations have been widely adopted in recommender systems where a large number of entities are represented using embedding vectors. As the cardinality of the entities increases, the embedding components can easily contain millions of parameters and become the bottleneck in both storage and inference du…

2019-11-05abs ↗pdf ↗

Consider a physical system for which a mathematically rigorous geometric quantization procedure exists. Now subject the system to a finite set of irreducible first class (bosonic) constraints. It is shown that there is a mathematically rigorous BRST quantization of the constrained system whose cohomology at ghost numbe…

2006-04-12abs ↗pdf ↗

DQA efficiently quantizes deep neural network activations for resource-constrained devices.

problem Efficiently quantizing deep neural network activations for resource-constrained devices.
method DQA uses simple shifting-based operations and Huffman coding for sub-6-bit quantization.
result DQA achieves significantly better accuracy than direct quantization and state-of-the-art methods.

AskewSGD optimizes quantized neural networks with interval-constrained optimization.

problem Training deep neural networks with quantized weights.
method Formulates QNN training as smoothed interval-constrained optimization, proposes AskewSGD for solving each subproblem.
result AskewSGD avoids projections and allows infeasible iterates, performs better than state-of-the-art methods.

Due to its efficiency and ease to implement, stochastic gradient descent (SGD) has been widely used in machine learning. In particular, SGD is one of the most popular optimization methods for distributed learning. Recently, quantized SGD (QSGD), which adopts quantization to reduce the communication cost in SGD-based di…

2019-01-10abs ↗pdf ↗

The consequences for Berezin's quantization on symmetric spaces of the identity of the set of coherent vectors orthogonal to a fixed one with the cut locus are stated precisely. It is shown that functions expressing the coherent states, the covariant symbols of operators, the diastasis function, the characteristic and …

1997-07-31abs ↗pdf ↗

We introduce a data-free quantization method for deep neural networks that does not require fine-tuning or hyperparameter selection. It achieves near-original model performance on common computer vision architectures and tasks. 8-bit fixed-point quantization is essential for efficient inference on modern deep learning …

2019-06-11abs ↗pdf ↗

In this lecture results on the Berezin-Toeplitz quantization of arbitrary compact quantizable Kaehler manifolds are presented. These results are obtained in joint work with M. Bordemann and E. Meinrenken. The existence of the Berezin-Toeplitz deformation quantization is also covered. Recent results obtained in joint wo…

2000-09-25abs ↗pdf ↗

In the framework of geometric quantization we extend the Bohr-Sommerfeld rules to a full quantization theory which resembles Heisenberg's matrix theory. This extension is possible because Bohr-Sommerfeld rules not only provide an orthogonal basis in the space of quantum states, but also give a lattice structure to this…

2012-07-05abs ↗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.