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

50101151201 · Jun 202019922001200920172026
48 results for Transformer quantization

A new quantization strategy reduces Transformer model size and inference time.

problem Heavy computation load and memory overhead in Transformer models for mobile devices.
method Mixed precision quantization with varying bits per word in embedding blocks.
result 11.8x smaller model size and 3.5x speed up for on-device NMT.

BiTAT improves neural network quantization for edge devices by focusing on weight dependencies and disentangling them.

problem Performance degradation of compact neural networks under extreme quantization.
method Task-dependent Aggregated Transformation (BiTAT) method that orthonormalizes weights and progressively quantizes them.
result BiTAT effectively preserves model performance on ImageNet and CIFAR-100 with compact backbones.

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 ↗

DFRot improves LLMs by reducing outlier and massive activation effects.

problem Reducing outlier and massive activation effects in rotated LLMs.
method Weighted loss function and orthogonal Procrustes transforms for rotation matrix refinement.
result DFRot achieves dual free (Outlier-Free and Massive Activation-Free) with significant improvements in perplexity.

The paper studies quantization on symplectic manifolds with real polarizations, comparing different quantization methods.

problem Quantization on compact symplectic manifolds with real polarizations.
method Geometric quantization, Toeplitz operators, Fourier transforms, asymptotic expansion of traces.
result Deformation quantization is realized through asymptotic traces of Toeplitz operators.

Smooth approximations of Kähler-Ricci solitons found using quantized metrics and Futaki invariants.

problem Finding smooth approximations of Kähler-Ricci solitons on Fano manifolds.
method Using semiclassical estimates and quantized Futaki invariants to extend a strategy from Donaldson and Tian-Zhu.
result Smooth approximations of Kähler-Ricci solitons can be found as quantized metrics.

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 ↗

New method preserves spectral clustering performance under aggressive sparsification and quantization.

problem Maintaining spectral clustering performance with sparse and quantized data.
method Random matrix theory applied to eigenspectrum changes under sparsification and quantization.
result Spectral clustering performance is preserved even with aggressive sparsification and quantization.

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.

Mackey showed that for a compact Lie group KK, the pair (K,C0(K))(K,C^{0}(K)) has a unique non-trivial irreducible covariant pair of representations. We study the relevance of this result to the unitary equivalence of quantizations for an infinite-dimensional family of K×KK\times K invariant polarizations on TKT^{\ast}K. The …

2012-11-09abs ↗pdf ↗

S2D selectively decays large singular values to improve quantization of neural activations.

problem Large activation outliers in transformer models cause accuracy drops during quantization.
method Selective Spectral Decay (S2DS^2D) that surgically regularizes only the largest singular values.
result Significantly reduces activation outliers and produces well-conditioned representations.

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 method for vectorizing persistence diagrams simplifies topological data analysis.

problem Challenges in integrating persistence diagrams into machine learning pipelines.
method Quantized Persistence and Integral transforms of Diagrams (Qupid) using binning and discrete transforms.
result Qupid preserves highly competitive performances compared to state-of-the-art methods across various classification tasks.

The paper is devoted to the comparison of the Fukaya category (it is responcible for the A-side of mirror symmetry) with the category of holonomic modules over the quantized algebra of functions on the same symplectic manifold. We conjecture that these categories become AA_{\infty}-equivalent after a twist by a kind o…

2002-02-20abs ↗pdf ↗

New insights into quantized neural networks reveal learning dynamics and generalization errors.

problem Understanding the impact of quantization hyperparameters on learning dynamics in high-dimensional models.
method Theoretical analysis and fixed-point analysis of STE dynamics in quantized models.
result STE training in quantized models converges to a plateau followed by a sharp drop in generalization error, influenced by quantization range.

Neural network quantization has become an important research area due to its great impact on deployment of large models on resource constrained devices. In order to train networks that can be effectively discretized without loss of performance, we introduce a differentiable quantization procedure. Differentiability can…

2018-10-03abs ↗pdf ↗

This paper provides theoretical foundations for using quantized actions in behavior cloning.

problem Applying autoregressive models to continuous control requires discretizing actions through quantization, which is poorly understood.
method The paper analyzes quantization error propagation and statistical sample complexity, and proposes model-based augmentation.
result Behavior cloning with quantized actions achieves optimal sample complexity, matching existing lower bounds.

Let (M,g)(M,g) be a pseudo-Riemannian manifold and Fλ(M)F_λ(M) the space of densities of degree λλ on MM. We study the space Dλ,μ2(M)D^2_{λ,μ}(M) of second-order differential operators from Fλ(M)F_λ(M) to Fμ(M)F_μ(M). If (M,g)(M,g) is conformally flat with signature pqp-q, then Dλ,μ2(M)D^2_{λ,μ}(M) is viewed as a module over the group of confo…

1998-01-27abs ↗pdf ↗

For any Lie groupoid GG, the vector bundle gg^* dual to the associated Lie algebroid gg is canonically a Poisson manifold. The (reduced) C*-algebra of GG (as defined by A. Connes) is shown to be a strict quantization (in the sense of M. Rieffel) of gg^*. This is proved using a generalization of Weyl's quantization…

1999-03-23abs ↗pdf ↗

Study develops numerical schemes for non-Markovian volatility models with memory.

problem Existence and uniqueness of strong solutions for non-Markovian SDEs.
method Functional quantization scheme based on Lamperti transformation.
result Theoretical foundation for numerical schemes applied to specific models.

This paper proposes a new subspace learning method, named Quantized Fisher Discriminant Analysis (QFDA), which makes use of both machine learning and information theory. There is a lack of literature for combination of machine learning and information theory and this paper tries to tackle this gap. QFDA finds a subspac…

2019-09-06abs ↗pdf ↗

Paper proposes a method to speed up DNNs by quantizing Winograd/Toom-Cook convolutions.

problem Speeding up convolution computations in DNNs with reduced time consumption and improved accuracy.
method Application of base change technique for quantized Winograd-aware training model.
result 8-bit quantized network achieves nearly the same accuracy as direct quantized convolution with minimal additional operations.

Transformers can cluster data from Gaussian mixtures without supervision.

problem Clustering data from Gaussian mixtures without labeled data.
method Theoretical analysis of attention-based layers, focusing on a simplified two-head attention layer and an identity matrix attention layer.
result Attention-based layers can align with true mixture centroids and adapt to input-specific distributions.

An index formula is proposed for contact transformations between contact manifolds equipped with CR structures or with fillings by symplectic manifolds. The formula generalizes the Atiyah-Singer formula and gives a conjectured formula for the index of Fourier integral operators, as well as Epstein's relative index for …

1998-08-05abs ↗pdf ↗

Lightweight architectural designs of Convolutional Neural Networks (CNNs) together with quantization have paved the way for the deployment of demanding computer vision applications on mobile devices. Parallel to this, alternative formulations to the convolution operation such as FFT, Strassen and Winograd, have been ad…

2020-02-25abs ↗pdf ↗

A membrane technique, in which the symplectic and Ricci forms are integrated over surfaces in a complexification of the phase space, as well a ``creation" connection with zero curvature over lagrangian submanifolds, is used to obtain a unified quantization including a noncommutative algebra of functions, its representa…

1995-08-09abs ↗pdf ↗

This paper develops quantization algorithms for random Fourier features, simplifying the process and improving performance.

problem Efficient quantization of random Fourier features for better performance and storage.
method Developed Lloyd-Max (LM) and LM2^2-RFF quantization schemes for random Fourier features.
result The marginal distribution of RFF is independent of the Gaussian kernel parameter γ, simplifying quantization design.

Efficiently processes dynamic inputs in AI writing assistants with incremental computation.

problem Efficiently updating AI models in real-time with dynamic inputs.
method Incremental computing using vector quantization to filter and reuse intermediate values in neural networks.
result Comparable accuracy with 12.1X fewer operations for processing dynamic inputs.

Theorems adapted for prequantum systems, showing symplectomorphism and gauge transformation.

problem Adapting classical theorems to prequantum systems.
method Establishing analogs of the Darboux, Moser, and Weinstein theorems.
result Prequantum systems with vanishing first cohomology are equivalent up to symplectomorphism and gauge transformation.

In this paper, we study the analytic continuation to complex time of the Hamiltonian flow of certain G×TG\times T-invariant functions on the cotangent bundle of a compact connected Lie group GG with maximal torus TT. Namely, we will take the Hamiltonian flows of one G×GG\times G-invariant function, hh, and one $G\time…

2019-07-11abs ↗pdf ↗