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

152303455606 · Jun 202019922001200920172026
48 results for Riemannian stochastic approximation

Riemannian stochastic gradient descent approximates a diffusion process called Riemannian stochastic modified flow.

problem Improving convergence rate of Riemannian stochastic gradient descent.
method Using stochastic differential geometry, the paper shows RSGD can be approximated by the Riemannian stochastic modified flow (RSMF).
result RSGD can be approximated by the solution to the RSMF driven by an infinite-dimensional Wiener process, increasing the order of approximation.

Optimal algorithms for Riemannian optimization with reduced complexity.

problem Stochastic optimization on Riemannian manifolds with limited data.
method Zeroth-order Riemannian Averaging Stochastic Approximation algorithms using Riemannian moving-average estimators and novel geometric conditions.
result Achieves optimal sample complexities for generating approximate first-order stationary solutions.

Study stochastic processes on surfaces in contact sub-Riemannian manifolds using Riemannian approximations.

problem Analyzing stochastic processes on surfaces in contact sub-Riemannian manifolds.
method Employing Riemannian approximations, a second order partial differential operator is derived on the surface. The stochastic process moves along the characteristic foliation induced by the contact distribution.
result Elliptic characteristic points are inaccessible, while hyperbolic characteristic points are accessible from separatrices.

The paper analyzes convergence of Riemannian SA schemes for stochastic optimization.

problem Stochastic optimization problems on Riemannian manifolds.
method Analyzes convergence of Riemannian stochastic approximation schemes using exponential map or retraction functions.
result Shows Riemannian SA schemes find an O(b+logn/n){\mathcal{O}}(b_\infty + \log n / \sqrt{n})-stationary point within O(n){\mathcal{O}}(n) iterations.

Study radial processes in sub-Riemannian Brownian motions, proving stochastic completeness and eigenvalue estimates.

problem Analyzing sub-Riemannian Brownian motions and their radial processes.
method Application of Itô's formula and sub-Laplacian comparison theorems to prove stochastic completeness and eigenvalue estimates.
result Proved Cheng's type estimates for Dirichlet eigenvalues of sub-Riemannian metric balls.

Study of intrinsic sub-Laplacian for hypersurfaces in contact sub-Riemannian manifolds.

problem Characterizing the intrinsic sub-Laplacian for hypersurfaces in contact sub-Riemannian manifolds.
method Construction and analysis of the intrinsic sub-Laplacian using Riemannian approximations and stochastic processes.
result The intrinsic sub-Laplacian is stochastically complete, ensuring the process does not hit characteristic points.

Paper shows LL^\infty-positivity and stochastic completeness are equivalent.

problem Analyzing LL^\infty-positivity preserving property and stochastic completeness.
method Using monotone approximation results for distributional solutions of Δ+10-Δ+ 1 \ge 0.
result The LL^\infty-positivity preserving property is equivalent to stochastic completeness.

In this paper, we prove the existence of martingale solutions to the stochastic heat equation taking values in a Riemannian manifold, which admits Wiener (Brownian bridge) measure on the Riemannian path (loop) space as an invariant measure using a suitable Dirichlet form. Using the Andersson-Driver approximation, we he…

2017-11-27abs ↗pdf ↗

New geometric SDEs and discretizations on Riemannian manifolds with error bounds.

problem Modeling diffusion processes on Riemannian manifolds with geometric SDEs.
method Introduced a new construction of geometric SDEs and provided non-asymptotic error bounds.
result First non-asymptotic error bound for geometric Euler-Murayama discretization.

We propose a stochastic gradient Markov chain Monte Carlo (SG-MCMC) algorithm for scalable inference in mixed-membership stochastic blockmodels (MMSB). Our algorithm is based on the stochastic gradient Riemannian Langevin sampler and achieves both faster speed and higher accuracy at every iteration than the current sta…

2015-10-16abs ↗pdf ↗

SMAVE optimizes SDR by projecting onto a low-dimensional subspace on a Riemannian manifold.

problem High-dimensional regression challenges due to the curse of dimensionality.
method SMAVE combines nearest-neighbor localization and Riemannian stochastic gradient ascent.
result SMAVE achieves almost-sure convergence and matches RMAVE's synthetic subspace recovery rate.

Constructs stochastic processes on sub-Riemannian manifolds using Cartan connections.

problem Developing stochastic processes on sub-Riemannian manifolds.
method Introduces stochastic development using Cartan connections, derives generator, and provides conditions for existence.
result Derives a general expression for the generator of the stochastic process and provides conditions for the existence of a Cartan connection.

The paper proposes a novel method for optimizing bounded functions using Fourier series and Ricci flow.

problem Optimizing bounded functions using Fourier series and Ricci flow.
method Approximating the initial manifold using Fourier series and center/boundary sampling. Iteratively evolving the manifold using geodesic hyper-spheres and inverse Ricci flow.
result The method allows for the optimization of high curvature regions and achieves potential global optima.

Study approximates sub-Riemannian structures with Riemannian metrics and analyzes spectral convergence.

problem Approximating sub-Riemannian structures for analysis.
method Constructing Riemannian metrics tailored to sub-Riemannian structures and studying spectral convergence.
result Riemannian volumes converge to Popp's volume and spectral convergence of Laplace operators is studied.

The article constructs stochastic integration in Riemannian manifolds.

problem No specific problem stated; focuses on the construction of stochastic integration.
method Functional-analytic approach to stochastic integration in Riemannian manifolds.
result There are infinitely many stochastic integrals, and they are related by a simple formula.

The SABR model is a stochastic volatility model not admitting a closed form solution. Hagan, Kumar, Leniewski and Woodward have obtained an approximate solution by means of perturbative techniques. A more precise approximation was found by Henry-Labordère with the heat kernel expansion method. The latter relies on deep…

2012-01-06abs ↗pdf ↗

The study provides conditions for approximating Riemannian manifolds with polyhedral metrics.

problem Approximating Riemannian manifolds with polyhedral metrics.
method Conditions on curvature tensors for Lipschitz and local polyhedral approximations.
result Conditions are sufficient for local polyhedral approximations, conjectured to be sufficient for global approximations.

High-probability bound for distributed stochastic approximation tracking error.

problem Analyzing the convergence of distributed stochastic approximation schemes.
method Analysis using ODE approach to stochastic approximation.
result High probability bound for tracking error between iterates and limiting differential equation.

Functional-analytic method for stochastic parallel transport in bundles.

problem Stochastic parallel transport in Hermitian bundles over Riemannian manifolds.
method Purely functional-analytic construction.
result Obtained a general Feynman-Kac formula in vector bundles.

Two new methods solve nonsmooth optimization on Riemannian Stiefel manifold.

problem Optimization over nonsmooth, non-differentiable functions on Riemannian manifolds.
method R-ProxSGD and R-ProxSPB, generalizing proximal SGD and SpiderBoost.
result R-ProxSPB finds ε-stationary points with IFO complexity of Ø(ε^(-3)) in online and Ø(n + √nε^(-2)) in finite-sum cases.

We study the stochastic Riemannian gradient algorithm for matrix eigen-decomposition. The state-of-the-art stochastic Riemannian algorithm requires the learning rate to decay to zero and thus suffers from slow convergence and sub-optimal solutions. In this paper, we address this issue by deploying the variance reductio…

2016-05-26abs ↗pdf ↗

Deviation inequalities for stochastic approximation methods.

problem Establishing bounds on the deviation of stochastic approximation methods.
method Martingale approximation method for separately Lipschitz functions.
result Established various deviation inequalities for stochastic approximation by averaging and minimization.

Neural networks can approximate complex stochastic equations well.

problem Approximating general stochastic differential equations.
method Identified neural network classes approximating continuous functions.
result Neural stochastic differential equations can approximate general stochastic differential equations arbitrarily well.

New algorithms for approximating stochastic processes efficiently.

problem Finding accurate finite approximations for stochastic processes.
method Develops new algorithms and fast implementations for approximating stochastic processes.
result Efficient approximations for stochastic processes can be found.

The paper develops stochastic methods on geometric spaces for transformations.

problem Existence and uniqueness of stochastic processes on geometric spaces.
method Stochastic parallel transport and equivariant diffusions on the group of diffeomorphisms.
result Existence and uniqueness of stochastic parallel transport and equivariant diffusions.

This work analyzes nonexpansive stochastic approximations with Markovian noise, proving convergence in reinforcement learning.

problem Applying stochastic approximation to reinforcement learning settings with nonexpansive operators.
method Investigates nonexpansive stochastic approximations with Markovian noise, providing asymptotic and finite sample analysis.
result First-time proof of convergence for classical tabular average reward temporal difference learning.

Paper develops SINNOs for approximating stochastic processes.

problem Approximating stochastic processes with neural networks.
method Developed stochastic interpolation neural network operators (SINNOs) with random coefficients.
result Established boundedness, interpolation accuracy, and approximation capabilities of SINNOs.

RNGI model bridges two probability densities on Riemannian manifolds efficiently.

problem Limited applicability of Euclidean stochastic interpolants to Riemannian manifolds.
method Introduces RNGI model interpolating between Riemannian manifold probability densities along geodesics.
result Proves temporal marginal density solves transport equation on Riemannian manifold.

Universal approximation for stochastic processes using Brownian motion.

problem Approximating stochastic processes with linear functionals.
method Establishing LpL^p-type universal approximation theorems for rough path spaces.
result Linear functionals on the signature of time-extended Brownian motion can approximate any pp-integrable stochastic process.

Study on local convergence of min-max algorithms to differential equilibria on Riemannian manifolds.

problem Solving zero-sum differential games on Riemannian manifolds.
method Analysis of two simultaneous min-max algorithms, ττ-GDA and ττ-SGA, to differential Stackelberg and Nash equilibria, with conditions for linear convergence and asymptotic approximation.
result Established sufficient conditions for linear convergence of ττ-GDA and demonstrated faster convergence of ττ-SGA in some cases.

Approximates derivative pricing under fractional stochastic volatility.

problem Derivative pricing under fractional stochastic volatility model.
method Approximate expression derived from deterministic functions and fractional Ornstein-Uhlenbeck process.
result Numerical simulations show the feasibility and effect of long-range dependencies on derivative prices.