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,695 papers · 148 categories

Trend · papers per month

94188282376 · Jun 202019922001200920172026
48 results for stochastic diffusion paths

Algorithm minimizes risk for multiclass classification of stochastic diffusion paths.

problem Multiclass classification of stochastic diffusion paths with distinct drift functions.
method Empirical risk minimization using L2 risk.
result Achieves fast rates of convergence under margin assumption.

We use GANs and signatures to approximate conditional laws in filtering and prediction of diffusion processes.

problem Approximating conditional laws for diffusion processes with noisy observations.
method Conditional GANs combined with signatures for approximation.
result Efficient approximation of conditional laws for diffusion processes.

Develops diffusion samplers for target distributions with efficient score and density estimates.

problem Estimating scores and densities for time-varying distributions.
method Sequential Monte Carlo with diffusion paths and control variates.
result Effective samplers for time-varying distributions with theoretical guarantees and practical applications.

Parameter inference for stochastic differential equations is challenging due to the presence of a latent diffusion process. Working with an Euler-Maruyama discretisation for the diffusion, we use variational inference to jointly learn the parameters and the diffusion paths. We use a standard mean-field variational appr…

2018-02-09abs ↗pdf ↗

Neural Diffusion Intensity Models simplify Cox processes inference.

problem Intractable nonparametric estimation and posterior inference of latent stochastic intensity in Cox processes.
method Variational framework using neural SDEs, with theoretical guarantee of ELBO maximization coinciding with maximum likelihood estimation.
result Accurate recovery of latent intensity dynamics and posterior paths with significant speedup.

Study of most probable paths for anisotropic Brownian motions on manifolds.

problem Characterizing paths of Brownian motions with anisotropic diffusion on manifolds.
method Using stochastic development and fiber bundle of linear frames, the study provides a comprehensive characterization of most probable paths.
result Explicit equations and integration methods for most probable paths on different geometries, including constant curvature surfaces.

New method converts and optimizes sampling schedules for generative models.

problem Optimizing sampling schedules for generative models like flows and diffusions.
method Unified framework for stochastic interpolants, including point mass schedules.
result Demonstrated efficient generation of images with fewer steps.

Adjoint sampler targets infinite-dimensional function spaces for efficient sampling.

problem Limited theory and algorithms for sampling infinite-dimensional function spaces.
method Adjoint Sampler for infinite-dimensional function spaces based on stochastic maximum principle.
result FAS achieves superior performance in synthetic and real systems.

New method approximates diffusion process posteriors using moment functions.

problem Approximating posteriors of stochastic differential equations.
method Constructs variational process as controlled prior, approximates posterior with moment functions, uses natural gradient descent.
result Richer variational approximations for state-dependent diffusion terms.

GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.

problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.

Novel framework synthesizes stochastic trajectories with anticipated structural breaks.

problem Synthesizing forward-looking, time-evolving stochastic trajectories with anticipated structural breaks.
method Anticipatory Neural Jump-Diffusion (ANJD) flow, AVNSG for dynamic spectral whitening.
result The framework effectively captures non-commutative moments and high-order stochastic texture.

We consider the exact path sampling of the squared Bessel process and some other continuous-time Markov processes, such as the CIR model, constant elasticity of variance diffusion model, and hypergeometric diffusions, which can all be obtained from a squared Bessel process by using a change of variable, time and scale …

2009-10-21abs ↗pdf ↗

Optimal control theory connects diffusion models to generative modeling.

problem Sampling from unnormalized densities in statistics and computational sciences.
method Deriving a Hamilton-Jacobi-Bellman equation and applying control theory to minimize Kullback-Leibler divergence.
result Time-reversed diffusion sampler (DIS) outperforms other diffusion-based sampling methods.

Develops methods to find most probable paths on complex manifolds.

problem Identifying optimal paths for manifold-valued processes, especially those with non-trivial structures.
method Constructs a general approach to defining and identifying most probable paths by measuring the Onsager-Machlup function on the anti-development of such processes.
result Derives explicit equations for development most probable paths that encompass various manifold-valued processes.

Study builds a classifier for diffusions with unknown diffusion but known drifts.

problem Multiclass classification of S.D.E. paths with unknown diffusion coefficient.
method Plug-in classifier using nonparametric estimators of drift and diffusion functions.
result Consistent classification procedure with rate of convergence under different assumptions.

Flow Matching enables robust training of CNFs with various probability paths.

problem Training Continuous Normalizing Flows (CNFs) at large scales.
method Flow Matching (FM) is a simulation-free approach for training CNFs by regressing vector fields of conditional probability paths.
result Flow Matching with diffusion paths yields more robust and stable training compared to diffusion-based methods.

In this paper we outline methodology to efficiently simulate (jump) diffusion bridge sample paths without discretisation error. We achieve this by considering the simulation of conditioned (jump) diffusion bridge sample paths in light of recent work developing a mathematical framework for simulating finite dimensional …

2015-05-12abs ↗pdf ↗

A new method for stochastic optimal control improves accuracy over existing techniques.

problem Improving the accuracy of stochastic optimal control for noisy systems.
method Stochastic Optimal Control Matching (SOCM) using Iterative Diffusion Optimization (IDO) with path-wise reparameterization trick.
result SOCM achieves lower error than existing techniques for three out of four control problems, sometimes by an order of magnitude.

Unified kernel framework extends to stochastic systems, improving numerical stability.

problem Extending kernel methods to stochastic dynamical systems with diffusion.
method Unified kernel framework, Feynman-Kac path-integral representations, collocation-based computational framework.
result Kernel equivalence under uniform ellipticity assumptions and improved numerical stability with moderate diffusion.

The Black-Scholes theory of option pricing has been considered for many years as an important but very approximate zeroth-order description of actual market behavior. We generalize the functional form of the diffusion of these systems and also consider multi-factor models including stochastic volatility. Daily Eurodoll…

2000-01-23abs ↗pdf ↗

The paper studies large deviation principles for stochastic volatility models with reflection, focusing on binary barrier options and call prices.

problem Large deviation principles for stochastic volatility models with reflection.
method Sample path and small-noise large deviation principles for the log-price process.
result Asymptotic behavior of binary barrier options and call prices in the small-noise regime.

Study improves sampling efficiency of diffusion models using RL and PDEs.

problem Training neural stochastic differential equations without access to target samples.
method Proves equivalences between RL methods and PDEs, uses coarse time discretization.
result Improves sample efficiency and reduces computational cost.

New MCMC method improves sampling from multimodal distributions.

problem Sampling from multimodal distributions is challenging for classical MCMC methods.
method Interpolating along the diffusion path, preserving mode weights and mixing properties.
result MAD-Path sampler improves global exploration and mode-weight estimation.

Extend classical theory of affine processes to path-dependent setting

problem Path-dependent affine processes
method Introduce path-dependent coefficients and provide analytic formulas for their Fourier--Laplace transform
result Define path-dependent affine processes through their exponential-affine Fourier--Laplace transform and establish a characterization theorem

In this paper a new dissimilarity measure to identify groups of assets dynamics is proposed. The underlying generating process is assumed to be a diffusion process solution of stochastic differential equations and observed at discrete time. The mesh of observations is not required to shrink to zero. As distance between…

2008-09-23abs ↗pdf ↗

AdaPID optimizes diffusion-based samplers by dynamically adjusting schedules.

problem Optimizing the intermediate-time dynamics in diffusion-based samplers.
method Develops a time-varying stiffness schedule using Piece-Wise-Constant (PWC) parametrizations and a hierarchical refinement approach.
result QoS-driven PWC schedules consistently improve sampling fidelity and accuracy.

New method transforms complex stochastic equations into simpler ones for efficient simulation.

problem Efficient simulation of complex path-dependent stochastic processes.
method Transforms Volterra-type SDEs into standard diffusion processes using convolution kernels.
result Proposes a numerical simulation scheme with a strong convergence rate of 1/2.

MF-PID uses interacting samples to efficiently transport probability mass.

problem Efficiently transporting probability mass in generative models.
method Introducing Mean-Field Path-Integral Diffusion (MF-PID) where samples become interacting agents.
result MF-PID achieves 19-24% reductions in control energy for demand-response control of energy systems.

Unified framework for inference in complex nonlinear processes.

problem Challenges in inferring nonlinear continuous stochastic processes with sparse observations and complex topologies.
method Neural Backward Filtering Forward Guiding (NBFFG) framework that constructs a variational posterior using a proxy linear-Gaussian process.
result Empirical results show NBFFG outperforms baselines on synthetic benchmarks and high-dimensional phylogenetic analysis tasks.

Quantum computing speeds up analysis of financial stochastic processes.

problem Challenging simulation and analysis of continuous time stochastic processes.
method Established a quantum framework for efficient state preparation and information extraction.
result Extraction of path-dependent and history-sensitive information from stochastic processes efficiently.

The paper analyzes the stationarity of stochastic Volterra integral equations and introduces fake stationary regimes.

problem Analyzing the stationarity of non-Markovian dynamical systems described by SVIEs.
method Investigates the properties of SVIE solutions, focusing on stationarity over finite and long time horizons, and introduces a deterministic stabilizer to induce a fake stationary regime.
result SVIEs do not exhibit a strong stationary regime unless the kernel is constant or degenerate, but a fake stationary regime can be achieved with a deterministic stabilizer.

New algorithm preserves transport maps for better diffusion model training.

problem Training diffusion models with task-specific optimality structures.
method Generalized Schrödinger Bridge Matching (GSBM), inspired by conditional stochastic optimal control.
result GSBM better preserves transport maps, enabling stable convergence and improved scalability.

Sig-DEG speeds up diffusion models by distilling them into faster approximations.

problem Computational intensity of diffusion models at inference time.
method Signature-based differential equation generation to summarize Brownian motion.
result Sig-DEG reduces inference steps by an order of magnitude while maintaining generation quality.