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

22456789 · Jun 202019922001200920172026
48 results for universal quantizer

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 ↗

I have chosen, in this presentation of Deformation Quantization, to focus on 3 points: the uniqueness --up to equivalence-- of a universal star product (universal in the sense of Kontsevich) on the dual of a Lie algebra, the cohomology classes introduced by Deligne for equivalence classes of differential star products …

2000-03-17abs ↗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.

FibQuant improves KV-cache compression for long-context inference.

problem Memory traffic bottleneck in long-context inference due to KV cache growth.
method Introduces FibQuant, a universal vector quantizer that combines Beta-quantile radii, Fibonacci/Roberts-Kronecker directions, and Lloyd-Max refinement.
result FibQuant achieves high compression rates with minimal loss in attention cosine similarity.

We prove that there are no nontrivial finite-dimensional Lie representations of certain Poisson algebras of polynomials on a compact symplectic manifold. This result is used to establish the existence of a universal obstruction to quantizing a compact symplectic manifold, regardless of the dimensionality of the represe…

1997-05-31abs ↗pdf ↗

This paper improves support recovery in universal one-bit compressed sensing with fewer measurements.

problem Support recovery in universal one-bit compressed sensing.
method Developed algorithms to recover the support of sparse signals with a small number of false positives.
result Support recovery with ildeO(k3/2) ilde{O}(k^{3/2}) measurements, improving to ildeO(k) ilde{O}(k) with known dynamic range.

The universal sl_2 invariant of bottom tangles has a universality property for the colored Jones polynomial of links. Habiro conjectured that the universal sl_2 invariant of boundary bottom tangles takes values in certain subalgebras of the completed tensor powers of the quantized enveloping algebra U_h(sl_2) of the Li…

2011-03-11abs ↗pdf ↗

We develop a new approach, based on quantization methods, to study higher symmetries of invariant differential operators. We focus here on conformally invariant powers of the Laplacian over a conformally flat manifold and recover results of Eastwood, Leistner, Gover and Šilhan. In particular, conformally equivariant qu…

2011-07-28abs ↗pdf ↗

The standard (Berezin-Toeplitz) geometric quantization of a compact Kaehler manifold is restricted by integrality conditions. These restrictions can be circumvented by passing to the universal covering space, provided that the lift of the symplectic form is exact. I relate this construction to the Baum-Connes assembly …

2003-04-17abs ↗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.

The universal sl_2 invariant of string links has a universality property for the colored Jones polynomial of links, and takes values in the h-adic completed tensor powers of the quantized enveloping algebra of sl_2. In this paper, we exhibit explicit relationships between the universal sl_2 invariant and Milnor invaria…

2014-05-13abs ↗pdf ↗

These are notes of a mini-course given at Dennisfest in June 2001. The goal of these notes is to give a self-contained survey of deformation quantization, operad theory, and graph homology. Some new results related to "String Topology" and cacti are announced in Section 2.7.

2001-11-01abs ↗pdf ↗

This paper improves support recovery in universal one-bit compressed sensing.

problem Support recovery in one-bit compressed sensing for sparse signals.
method Proposes approximate support recovery and superset recovery algorithms with polynomial-time complexity.
result Achieves improved support recovery with fewer measurements compared to existing methods.

We review recent works concerning deformation quantization of abelian supergroups. Indeed, we expose the construction of an induced representation of the Heisenberg supergroup and an associated pseudodifferential calculus by using Kirillov's orbits method. Then, a star-product is built on the abelian supergroup R^{m|n}…

2011-08-19abs ↗pdf ↗

Lectures on symplectic and Poisson geometry, quantization, and quantum field theory.

problem Exploring symplectic and Poisson structures and their applications in quantum field theory.
method Introduction to differential geometry, symplectic geometry, Poisson geometry, and deformation quantization.
result Detailed understanding of symplectic and Poisson structures and their quantization.

The recent framework of compressive statistical learning aims at designing tractable learning algorithms that use only a heavily compressed representation-or sketch-of massive datasets. Compressive K-Means (CKM) is such a method: it estimates the centroids of data clusters from pooled, non-linear, random signatures of …

2018-04-26abs ↗pdf ↗

In this note we describe the recursion relations between two parameter HOMLFY and Kauffman polynomials of framed links These relation correspond to embeddings of quantized universal enveloping algebras. The relation corresponding to embeddings gngk×slnkg_{n}\supset g_{k}\times sl_{n-k} where gng_{n} is either so2n+1so_{2n+1}, $so…

2014-01-09abs ↗pdf ↗

I sketch what it is supposed to mean to quantize gauge theory, and how this can be made more concrete in perturbation theory and also by starting with a finite-dimensional lattice approximation. Based on real experiments and computer simulations, quantum gauge theory in four dimensions is believed to have a mass gap. T…

2008-12-24abs ↗pdf ↗

In this work, we consider the use of model-driven deep learning techniques for massive multiple-input multiple-output (MIMO) detection. Compared with conventional MIMO systems, massive MIMO promises improved spectral efficiency, coverage and range. Unfortunately, these benefits are coming at the cost of significantly i…

2019-06-10abs ↗pdf ↗

A bottom tangle is a tangle in a cube consisting of arc components whose boundary points are on a line in the bottom square of the cube. A ribbon bottom tangle is a bottom tangle whose closure is a ribbon link. For every n-component ribbon bottom tangle T, we prove that the universal invariant J_T of T associated to th…

2009-05-12abs ↗pdf ↗

Let (X,ω)(X,ω) be a symplectic orbifold which is locally like the quotient of a Z2\mathbb{Z}_2 action on Rn\reals^n. Let AX(())A^{((\hbar))}_X be a deformation quantization of XX constructed via the standard Fedosov method with characteristic class being ωω. In this paper, we construct a universal deformation of the algebra…

2009-08-28abs ↗pdf ↗

In this work, a deep learning-based quantization scheme for log-likelihood ratio (L-value) storage is introduced. We analyze the dependency between the average magnitude of different L-values from the same quadrature amplitude modulation (QAM) symbol and show they follow a consistent ordering. Based on this we design a…

2019-06-18abs ↗pdf ↗

In a former paper we proposed a model for the quantization of gravity by working in a bundle EE where we realized the Hamilton constraint as the Wheeler-DeWitt equation. However, the corresponding operator only acts in the fibers and not in the base space. Therefore, we now discard the Wheeler-DeWitt equation and expr…

2015-01-05abs ↗pdf ↗

Recently, deep learning has achieved huge successes in many important applications. In our previous studies, we proposed quadratic/second-order neurons and deep quadratic neural networks. In a quadratic neuron, the inner product of a vector of data and the corresponding weights in a conventional neuron is replaced with…

2018-07-31abs ↗pdf ↗

We derive the quantum Teichmüller space, previously constructed by Kashaev and by Fock and Chekhov, from tensor products of a single canonical representation of the modular double of the quantum plane. We show that the quantum dilogarithm function appears naturally in the decomposition of the tensor square, the quantum…

2010-06-19abs ↗pdf ↗

We consider natural algebraic differential operations acting on geometric quantities over smooth manifolds. We introduce a method of study and classification of such operations, called IT-reduction. It reduces the study of natural operations to the study of polynomial maps between (vector) spaces of jets which are equi…

2006-07-04abs ↗pdf ↗

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 introduces a differentiable, scalable quantization method for neural networks.

problem Previous quantization methods lacked differentiability and scalability.
method The approach is differentiable and scalable, using bit-shifting and logarithmic quantization.
result The method achieves comparable accuracy to state-of-the-art approaches with less training time and lower inference cost.

StatQAT optimizes quantization for deep networks, reducing computational cost and memory usage.

problem Optimal quantization parameters selection for deep neural networks with diverse data distributions.
method Statistical error analysis framework for uniform and floating-point quantization, iterative and analytic quantizers designed for arbitrary and Gaussian-like distributions.
result Improved accuracy and stability in training low-precision neural networks.

This study optimizes quantized neural networks by considering model architecture and quantization types.

problem Optimizing quantized neural networks for low-power, high-throughput applications.
method Holistic approach including training methods and quantization-friendly architecture design.
result Deeper models are more sensitive to activation quantization, while wider models improve resilience to both weight and activation quantization.

We construct a non-formal deformation machinery for the actions of the Heisenberg supergroup analogue to the one developed by M. Rieffel for the actions of R^d. However, the method used here differs from Rieffel's one: we obtain a Universal Deformation Formula for the actions of R^{m|n} as a byproduct of Weyl ordered K…

2010-11-10abs ↗pdf ↗

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.