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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for functional quantization

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.

Symmetries of Poisson manifolds are in general quantized just to symmetries up to homotopy of the quantized algebra of functions. It is therefore interesting to study symmetries up to homotopy of Poisson manifolds. We notice that they are equivalent to Poisson principal bundles and describe their quantization to symmet…

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

Develops a new method for quantizing rough volatility for volatility derivatives pricing.

problem Pricing volatility derivatives in rough volatility models.
method Functional quantization of rough volatility using offline computable quantizers.
result Pricing VIX Futures in the rough Bergomi model shows competitive results.

Quantized neural networks can represent all fixed-point functions under certain conditions.

problem Expressive power of quantized neural networks under fixed-point arithmetic.
method Analyzing necessary and sufficient conditions for quantized networks to represent all fixed-point functions.
result Various popular activation functions satisfy the sufficient condition for representing all fixed-point functions.

Study identifies three quantization regimes for ReLU networks.

problem Approximation of Lipschitz functions by ReLU networks with finite-precision weights.
method Established through nonasymptotic tight lower and upper bounds on minimax approximation error.
result Memory-optimality achieved in proper quantization regime for deep networks.

Paper proposes a new binary quantization method for faster DNN inference.

problem Accelerating deep neural network inference on resource-limited devices.
method Quantized Compressed Sensing (QCS) for binary quantization.
result The proposed method preserves benefits of standard methods while reducing quantization error.

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.

Neural network models are resource hungry. It is difficult to deploy such deep networks on devices with limited resources, like smart wearables, cellphones, drones, and autonomous vehicles. Low bit quantization such as binary and ternary quantization is a common approach to alleviate this resource requirements. Ternary…

2019-09-26abs ↗pdf ↗

Paper proposes a fast stochastic algorithm for neural network quantization with error bounds.

problem Error analysis for quantized neural networks with non-convex loss functions and nonlinear activations.
method Greedy path-following mechanism combined with stochastic quantizer.
result Established full-network error bounds for quantized neural networks.

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 ↗

We consider the problem of decentralized consensus optimization, where the sum of nn smooth and strongly convex functions are minimized over nn distributed agents that form a connected network. In particular, we consider the case that the communicated local decision variables among nodes are quantized in order to all…

2018-06-29abs ↗pdf ↗

For a possibly singular subset of a regular Poisson manifold we construct a deformation quantization of its algebra of Whitney functions. We then extend the construction of a deformation quantization to the case where the underlying set is a subset of a not necessarily regular Poisson manifold which can be written as t…

2013-10-23abs ↗pdf ↗

This paper is devoted to the pricing of Barrier options by optimal quadratic quantization method. From a known useful representation of the premium of barrier options one deduces an algorithm similar to one used to estimate nonlinear filter using quadratic optimal functional quantization. Some numerical tests are fulfi…

2010-12-05abs ↗pdf ↗

New bound on partition function proves Kähler-Einstein stability.

problem Proving Kähler-Einstein metrics on complex manifolds.
method Quantitative bound on partition function, connecting probabilistic and quantization approaches.
result Direct analytic proof of Kähler-Einstein stability for uniformly Gibbs stable manifolds.

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 ↗

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.

Quantized Variational Inference improves ELBO optimization with fast convergence.

problem Maximizing Evidence Lower Bound (ELBO) for variational inference.
method Optimal Voronoi Tesselation for variance-free gradients, Richardson extrapolation for asymptotic improvement.
result Quantized Variational Inference leads to fast convergence with comparable computational cost.

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.

Formally equates two quantization methods and constructs non-commutative algebras.

problem Equivalence of deformation and geometric quantization methods.
method Symplectic reduction and Lie 2-groupoid quantization.
result Recovery of strict deformation quantizations and non-associative products.

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 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 ↗

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.

DJPQ optimizes neural network pruning and quantization for hardware efficiency.

problem Efficiently compress neural networks for hardware inference.
method Joint gradient-based optimization of pruning and quantization into a differentiable loss function.
result Significant reduction in Bit-Operations (BOPs) with minimal accuracy loss.

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 ↗

WaveQ uses sinusoidal regularization to optimize deep quantization for neural networks, improving both efficiency and accuracy.

problem Deep quantization reduces bitwidth but can lead to significant accuracy loss due to inter-layer dependencies.
method WaveQ employs sinusoidal regularization to learn multiple quantization parameters during gradient-based training, balancing compute efficiency and accuracy.
result WaveQ achieves accuracy preservation and efficiency gains across various deep networks, outperforming state-of-the-art techniques.