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

90181271361 · Jun 202019922001200920172026
48 results for linear SDEs

The paper identifies generators of linear SDEs with noise types.

problem Identifying the generator of linear SDEs from their solution distribution.
method Deriving sufficient and necessary conditions for additive noise, and sufficient conditions for multiplicative noise.
result Generic conditions for identifying the generator of linear SDEs with both types of noise.

The paper clarifies the approximation of SGD with Ito SDEs for finite learning rates.

problem Theoretical justification and experimental verification of the Ito SDE approximation for finite learning rates in SGD.
method An efficient simulation algorithm SVAG and a necessary condition test for the SDE approximation.
result The Ito SDE approximation can meaningfully capture training and generalization properties of deep nets with finite learning rates.

Proposes a method to estimate SDE noise from a single trajectory.

problem Estimating SDE noise from a single data trajectory without ergodicity or stationarity.
method Combining Taylor expansions, Girsanov transformations, and drift function's initial value for drift and noise estimation.
result First SSISDE algorithm capable of identifying SDE dynamics from a single trajectory.

We solve continuous-time latent SDE identifiability using diffusion shifts.

problem Identifiability of latent SDEs in continuous-time time series.
method Environment-induced shifts in diffusion covariance for additive-noise latent SDEs.
result Two diagonal diffusion regimes with distinct variance ratios identify latent coordinates up to permutation and scaling.

Efficiently infers latent SDEs with scalable memory and time costs.

problem Inference of latent SDEs with high time and memory complexity.
method Amortized reparametrization of expectations under linear SDEs, coupled with efficient gradient approximation.
result Achieves similar performance to adjoint sensitivities with fewer model evaluations.

Paper tackles robust control of SDEs with ambiguity, proving value function existence and applying to investment problems.

problem Robust control of SDEs with ambiguity parameters and non-Lipschitz coefficients.
method Existence and uniqueness of value function established through BSDEs with non-linear growth conditions.
result Existence and uniqueness of value function in proper space, verified through BSDEs.

New SDEs from affine and polynomial perspectives for path-dependent processes.

problem Characterizing path-dependent stochastic processes.
method Affine and polynomial processes, signature SDEs, Fourier-Laplace transform, Riccati and linear ODEs.
result Explicit formulas for the Fourier-Laplace transform and expected values of entire functions of signature processes.

We consider models of the population or opinion dynamics which result in the non-linear stochastic differential equations (SDEs) exhibiting the spurious long-range memory. In this context, the correspondence between the description of the birth-death processes as the continuous-time Markov chains and the continuous SDE…

2019-04-30abs ↗pdf ↗

This work provides a semi-analytic approximation method for decoupled forwardbackward SDEs (FBSDEs) with jumps. In particular, we construct an asymptotic expansion method for FBSDEs driven by the random Poisson measures with σ-finite compensators as well as the standard Brownian motions around the small-variance limit …

2015-10-12abs ↗pdf ↗

In this paper, we study the pricing of contingent claims under G-expectation. In order to accomodate volatility uncertainty, the price of the risky security is supposed to governed by a general linear stochastic differential equation (SDE) driven by G-Brownian motion. Utilizing the recently developed results of Backwar…

2013-03-18abs ↗pdf ↗

New method optimizes SDE models using continuous-time gradient descent.

problem Optimizing over the stationary distribution of SDE models.
method Continuous-time stochastic gradient descent for SDE models.
result Asymptotic convergence to the direction of steepest descent.

Develops a nonparametric model for arbitrage-free pricing of illiquid derivatives.

problem Modeling joint dynamics of liquid vanilla options for arbitrage-free pricing of illiquid derivatives.
method Derives a state space for prices respecting underlying financial constraints using neural networks and imposes constraints to preserve no-arbitrage conditions.
result Neural SDE models are guaranteed to satisfy a set of linear inequalities and validated with numerical experiments.

SDE Matching eliminates simulation for training Latent SDEs, achieving similar performance.

problem Training Latent SDEs with adjoint sensitivity methods is computationally expensive and limited.
method SDE Matching, inspired by Score- and Flow Matching, eliminates simulation for training Latent SDEs.
result SDE Matching achieves performance comparable to adjoint sensitivity methods while reducing computational complexity.

Paper introduces non-adversarial training for Neural SDEs using signature kernel scores.

problem Stability and mode collapse issues in adversarial training of Neural SDEs.
method Uses signature kernel scores as objective function for non-adversarial training.
result Non-adversarial training leads to better performance and more stable models.

New method estimates SDE parameters efficiently using WCE and SGD.

problem Parameter estimation for stochastic differential equations.
method Wiener Chaos Expansion and Stochastic Gradient Descent.
result Accurate parameter recovery from noisy observations.

Paper introduces FDM for efficient training of Neural SDEs.

problem Training Neural SDEs using existing methods is computationally expensive and unstable.
method Developed a novel scoring rule called Finite Dimensional Matching (FDM) to bypass signature kernels and reduce training complexity.
result FDM achieves superior performance in terms of computational efficiency and generative quality.

SA-Solver improves stochastic sampling from DPMs.

problem Efficient sampling from Diffusion Probabilistic Models (DPMs) is time-consuming.
method Proposes SA-Solver, an improved stochastic Adams method for solving diffusion SDE.
result SA-Solver achieves improved or comparable performance compared to SOTA methods for few-step sampling.

Study on the smoothness of solutions to a specific type of stochastic differential equation.

problem Regularity of solutions to mean-field GG-SDEs.
method Analysis of first and second order Fréchet differentiability in the random initial condition.
result Established the Fréchet differentiability of the solution and specified the corresponding equations.

Rex solves the inverse problem for ODE/SDE solvers, improving precision and stability.

problem Inversion of ODE/SDE solvers is inaccurate and impractical for precision applications.
method Rex uses Lawson methods to convert explicit Runge-Kutta schemes into algebraically reversible ones.
result Rex achieves near-machine-precision reconstruction and improves generative models.

This paper uses SDEs to analyze GANs training and long-run behavior.

problem Understanding the training process and long-run behavior of GANs.
method Established SDE approximations for GANs training and analyzed long-run behavior via invariant measures.
result The long-run behavior of GANs training can be studied via the invariant measures of its SDE approximations.

SGD on diagonal linear networks approximates to SDE in high dimensions.

problem Understanding optimization and generalization in neural models.
method High-dimensional analysis of SGD on diagonal linear networks, approximated by SDE.
result SGD dynamics in high dimensions converge exponentially to zero risk.

Proposes methods to include distributional information in MV-SDEs for better modeling of interacting particle systems.

problem Modeling the behavior of an infinite number of interacting particles with distributional information.
method Semi-parametric methods and estimators for MV-SDEs.
result Explicitly including distributional dependence improves performance in modeling temporal data with interaction.

We explain how Itô Stochastic Differential Equations (SDEs) on manifolds may be defined using 2-jets of smooth functions. We show how this relationship can be interpreted in terms of a convergent numerical scheme. We show how jets can be used to derive graphical representations of Itô SDEs. We show how jets can be used…

2016-02-12abs ↗pdf ↗

Study of stochastic differential equations on non-compact manifolds, solving open problem on strong completeness.

problem Open problem on strong completeness of SDEs on non-compact spaces.
method Systematic study of stochastic differential equations, solving open problem on strong completeness.
result Existence of global smooth solution flow of SDEs on R^n, including substantial growth of coefficients.

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.

This paper bridges the gap between ODE and SDE in diffusion models using Fokker-Planck equations.

problem Empirical evidence shows that ODE-based samples from score-based diffusion models are inferior to SDE-based samples.
method The paper rigorously describes dynamics and approximations in training score-based diffusion models, linking them to Fokker-Planck equations.
result Adding a regularisation term based on the Fokker-Planck residual can close the gap between ODE- and SDE-induced distributions.

New algorithm optimizes nonlinear SDEs online with convergence guarantees.

problem Optimizing nonlinear stochastic differential equations (SDEs) is computationally challenging.
method Forward propagation algorithm that solves an SDE derived using forward differentiation.
result Convergence theorem for nonlinear dissipative SDEs with bounds on stochastic fluctuations.

We developed efficient methods to compute gradients for Neural SDEs, improving training speed and accuracy.

problem Training Neural SDEs requires accurate and efficient computation of gradients, which is challenging due to the complexity of SDEs.
method We introduced a reversible Heun method for solving backwards-in-time SDEs and a Brownian Interval for sampling and reconstructing Brownian motion.
result Our methods significantly improve training speed and accuracy for Neural SDEs, outperforming state-of-the-art techniques.

We introduce a mean-reverting SDE whose solution is naturally defined on the space of correlation matrices. This SDE can be seen as an extension of the well-known Wright-Fisher diffusion. We provide conditions that ensure weak and strong uniqueness of the SDE, and describe its ergodic limit. We also shed light on a use…

2011-08-26abs ↗pdf ↗