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

3468101135 · Jun 202019922001200920172026
48 results for Product Recursive Quantization

A new method for robust product Markovian quantization overcomes numerical instabilities.

problem Numerical instabilities in the PMQ algorithm limit its adoption, especially for stochastic volatility models.
method Reformulated PMQ as standard vector quantization, applying accelerated Lloyd's algorithm for robustness.
result The method overcomes numerical instabilities and extends applicability to stochastic volatility models.

Improved Heston model produces steeper smile for short maturities.

problem Implied volatility surface does not produce a steep enough smile for short maturities.
method Introduced Stationary Heston model with invariant measure and used Product Recursive Quantization for numerical solution.
result Stationary Heston model produces a steeper smile for short maturities.

Unified framework for observables in n-plectic geometry.

problem Quantization of extended objects in higher geometric contexts.
method Develops a semi-simplicial set model for observables, using a Grassmann variable to encode submanifold codimensions.
result Establishes a categorified pre-n-Hilbert space and a quantization scheme matching multisymplectic geometry.

Quantization techniques have been applied in many challenging finance applications, including pricing claims with path dependence and early exercise features, stochastic optimal control, filtering problems and efficient calibration of large derivative books. Recursive Marginal Quantization of the Euler scheme has recen…

2017-01-06abs ↗pdf ↗

Quantization algorithms have been successfully adopted to option pricing in finance thanks to the high convergence rate of the numerical approximation. In particular, very recently, recursive marginal quantization has been proven to be a flexible and versatile tool when applied to stochastic volatility processes. In th…

2017-10-31abs ↗pdf ↗

Study quantization schemes on Kähler manifolds linking star products and BV quantizations.

problem Quantization of structures on Kähler manifolds.
method Construct Fedosov's star products and Batalin-Vilkovisky (BV) quantizations.
result One-loop exactness of BV quantizations, leading to a cochain level formula.

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 ↗

Inverted file and asymmetric distance computation (IVFADC) have been successfully applied to approximate nearest neighbor search and subsequently maximum inner product search. In such a framework, vector quantization is used for coarse partitioning while product quantization is used for quantizing residuals. In the ori…

2019-03-25abs ↗pdf ↗

We propose a quantization based approach for fast approximate Maximum Inner Product Search (MIPS). Each database vector is quantized in multiple subspaces via a set of codebooks, learned directly by minimizing the inner product quantization error. Then, the inner product of a query to a database vector is approximated …

2015-09-04abs ↗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 ↗

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.

We produce examples of codimension one foliations of the Euclidean and hyperbolic planes with bounded geometry which are topologically products, but for which leaves are non-recursively distorted. That is, the function which compares intrinsic distances in leaves with extrinsic distances in the ambient space grows fast…

2000-02-23abs ↗pdf ↗

Quantizes geodesic lengths in Teichmüller spaces using algebraic methods.

problem Constructing quantized geodesic lengths for Teichmüller spaces.
method Developed quantum trace maps and investigated algebraic structures.
result Showed a recursion relation and commutation properties for quantized trace-of-monodromy.

Study provides explicit formula for complex 2D Kähler manifold quantization.

problem Quantization of complex 2D locally symmetric Kähler manifolds.
method Deformation quantization with separation of variables, solving recurrence relations.
result Explicit formula for star product on complex 2D locally symmetric Kähler manifolds.

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.

The paper constructs a star product on a symplectically reduced phase space for a lattice gauge model.

problem Constructing a star product on a singular symplectically reduced phase space.
method Fedosov quantization, Levi-Civita connection, homological reduction.
result The symplectically reduced phase space of the lattice gauge model carries a star product.

Vectors of data are at the heart of machine learning and data mining. Recently, vector quantization methods have shown great promise in reducing both the time and space costs of operating on vectors. We introduce a vector quantization algorithm that can compress vectors over 12x faster than existing techniques while al…

2017-06-30abs ↗pdf ↗

Recursive Marginal Quantization (RMQ) allows fast approximation of solutions to stochastic differential equations in one-dimension. When applied to two factor models, RMQ is inefficient due to the fact that the optimization problem is usually performed using stochastic methods, e.g., Lloyd's algorithm or Competitive Le…

2017-04-21abs ↗pdf ↗

We formulate a quantization commutes with reduction principle in the setting where the Lie group GG, the symplectic manifold it acts on, and the orbit space of the action may all be noncompact. It is assumed that the action is proper, and the zero set of a deformation vector field, associated to the momentum map and a…

2013-09-26abs ↗pdf ↗

We propose an explicit construction of the deformation quantization of the general second-class constrained system, which is covariant with respect to local coordinates on the phase space. The approach is based on constructing the effective first-class constraint (gauge) system equivalent to the original second-class o…

2001-01-14abs ↗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.

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.

The paper constructs quantizations for symplectic manifolds with specific Laplacian properties.

problem Quantization of compact symplectic manifolds with higher Landau levels.
method Develops Berezin-Toeplitz quantization using a Bochner Laplacian with specific spectral properties.
result The quantization provides a formal star-product for the lowest Landau level.

Quantizes symplectic manifolds with toric singularities using Toeplitz operators.

problem Quantize symplectic manifolds with toric singularities.
method Establishes quantization for compact toric symplectic manifolds with transversal singular real polarizations using Toeplitz operators.
result Toeplitz operators determine a star product on compact toric symplectic manifolds with toric singularities as o0+\hbar o 0^+.

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.

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 ↗

Researchers create a star product on a Grassmannian with separation of variables.

problem Constructing a star product with separation of variables on G2,4(C)G_{2,4}(\mathbb{C}).
method Solving recurrence relations using creation and annihilation operators on a Fock space.
result Explicit formula for a star product with separation of variables on G2,4(C)G_{2,4}(\mathbb{C}).

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 ↗

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 ↗

In the first part of this paper we outline the constructions and properties of Fedosov star product and Berezin-Toeplitz star product. In the second part we outline the basic ideas and recent developments on Yau-Tian-Donaldson conjecture on the existence of Kähler metrics of constant scalar curvature. In the third part…

2019-04-26abs ↗pdf ↗

Neural network quantization is becoming an industry standard to efficiently deploy deep learning models on hardware platforms, such as CPU, GPU, TPU, and FPGAs. However, we observe that the conventional quantization approaches are vulnerable to adversarial attacks. This paper aims to raise people's awareness about the …

2019-04-17abs ↗pdf ↗

Paper quantizes heavy-tailed data for near optimal estimation rates.

problem Estimating parameters from heavy-tailed data with quantization.
method Truncate and dither data, then uniformly quantize; achieves near minimax rates.
result Near optimal estimation rates achievable with quantized data.