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

74148222296 · Jun 202019922001200920172026
48 results for Dynamic Quantization

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.

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.

This paper proposes a new way to quantize classical mechanical systems. Here we use ALAG - programme to construct moduli space of half weighted Bohr - Sommerfeld lagrangian cycles of fixed volume which is our quantum phase space. "Dynamical correspondence" principle makes possible to prove that this ALAG - quantization…

2001-06-01abs ↗pdf ↗

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 ↗

Study quantization effects on high-dimensional linear regression learning.

problem Understanding quantization's impact on learning high-dimensional linear regression models.
method Analyzes stochastic gradient descent for high-dimensional linear regression under various quantization targets.
result Establishes precise bounds on excess risk for different quantization schemes.

Equivariant quantization is a new theory that highlights the role of symmetries in the relationship between classical and quantum dynamical systems. These symmetries are also one of the reasons for the recent interest in quantization of singular spaces, orbifolds, stratified spaces... In this work, we prove existence o…

2010-01-26abs ↗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 ↗

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.

Efficient deep neural network (DNN) inference on mobile or embedded devices typically involves quantization of the network parameters and activations. In particular, mixed precision networks achieve better performance than networks with homogeneous bitwidth for the same size constraint. Since choosing the optimal bitwi…

2019-05-27abs ↗pdf ↗

In this contribution we review results on the kinematics of a quantum system localized on a connected configuration manifold and compatible dynamics for the quantum system including external fields and leading to non-linear Schrödinger equations for pure states.

1996-11-29abs ↗pdf ↗

We formulate the notion of minimax estimation under storage or communication constraints, and prove an extension to Pinsker's theorem for nonparametric estimation over Sobolev ellipsoids. Placing limits on the number of bits used to encode any estimator, we give tight lower and upper bounds on the excess risk due to qu…

2015-03-25abs ↗pdf ↗

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.

Improved neural quantization reduces accuracy loss to less than 1% with 4-bit weights.

problem Reducing accuracy loss in neural quantization below 8-bits.
method Layer-wise calibration and integer programming to optimize bit-width allocation.
result Less than 1% accuracy degradation with 4-bit weights and activations.

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.

The elastica is a curve in R3\R^3 that is stationary under variations of the integral of the square of the curvature. Elastica is viewed as a dynamical system that arises from the second order calculus of variations, and its quantization is discussed.

2015-07-06abs ↗pdf ↗

A new method improves quantile regression for high-dimensional data.

problem Handling heteroscedastic, multimodal, or skewed data in quantile regression.
method Dynamic prototypes-based probability density estimation with conformalized high-density quantile regression.
result Enhanced prediction regions with valid coverage guarantees and scalability to higher dimensions.

While increasingly deep networks are still in general desired for achieving state-of-the-art performance, for many specific inputs a simpler network might already suffice. Existing works exploited this observation by learning to skip convolutional layers in an input-dependent manner. However, we argue their binary deci…

2020-01-03abs ↗pdf ↗

QTD integrates quantization with diffusion for efficient data generation.

problem Challenges in continuous diffusion models, especially long-range transitions and biases.
method Quantized Transition Diffusion (QTD) integrates data quantization with discrete diffusion dynamics.
result QTD achieves efficient data generation with minimal score evaluations.

We construct a Poisson isomorphism between the formal Poisson manifolds g^* and G^*, where g is a finite dimensional quasitriangular Lie bialgebra. Here g^* is equipped with its Lie-Poisson (or Kostant-Kirillov-Souriau) structure, and G^* with its Poisson-Lie structure. We also quantize Poisson-Lie dynamical r-matrices…

2004-12-17abs ↗pdf ↗

Chaos and nonlinear economic dynamics are addressed for a quantum coupled map lattice model of an artificial economy, with quantized supply and demand equilibrium conditions. The measure theoretic properties and the patterns that emerge in both the economic business volume dynamics' diagrams as well as in the quantum m…

2012-02-29abs ↗pdf ↗

Geometric quantization extended to arbitrary connected spaces using path integration.

problem Constructing a Prequantum Groupoid for arbitrary connected parasymplectic spaces.
method Define a Total Group of Periods and a Prequantum Groupoid with connected isotropy.
result The Prequantum Groupoid Tω\mathbf{T}_\omega is isomorphic to the group of symmetries of the Dynamical System.

Deep convolutional neural networks (CNNs) are powerful tools for a wide range of vision tasks, but the enormous amount of memory and compute resources required by CNNs pose a challenge in deploying them on constrained devices. Existing compression techniques, while excelling at reducing model sizes, struggle to be comp…

2019-03-07abs ↗pdf ↗

Paper explores low-precision SGLD for neural networks, reducing costs without sacrificing performance.

problem Infeasibility of low-precision sampling in large-scale scenarios.
method Developed low-precision SGLD with quantization function and full-precision gradient accumulators.
result Low-precision SGLD achieves comparable performance to full-precision SGLD with only 8 bits.

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.

Combining neural networks and multiscale decomposition for financial market analysis.

problem Financial markets' complexity and mainstream models' limitations in capturing non-linear structures.
method Neural networks for non-linear associations combined with multiscale decomposition.
result Improved understanding of financial market data substructures.