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

3537061,0581,411 · Jun 202019922001200920172026
48 results for ODE/SDE models

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.

Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…

2019-06-05abs ↗pdf ↗

Stochastic neural ODEs outperform deterministic ones on image classification tasks.

problem Improving generalization in continuous-time models like neural ODEs.
method Empirical study of stochastically regularized neural ODEs using SDEs.
result Data augmentation negates the benefits of stochastic regularization, making neural ODEs and SDEs nearly equivalent.

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.

New error bounds for flow matching methods using deterministic sampling.

problem Improving the accuracy of flow matching methods for generating probability distributions.
method Derived error bounds for flow matching methods under deterministic sampling conditions.
result Presented error bounds for flow matching methods using L2L^2 loss and regularity conditions.

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.

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 ↗

New estimator for SDEs is shown to be an adjoint state method.

problem Estimating gradients for overparameterized SDEs efficiently.
method Demonstrates generator gradient estimator as an adjoint state method.
result Generator gradient estimator is an adjoint state method for SDEs.

In this paper we derive a scaling limit for an infinite dimensional limit order book model driven by Hawkes random measures. The dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator. With our choice of scaling the dynamics converges to a coupled SDE-ODE s…

2017-09-05abs ↗pdf ↗

Derives scaling limits and fluctuations for SGD in high dimensions.

problem Understanding SGD behavior in high-dimensional settings with varying noise levels.
method Interacting particle system approach, treating SGD iterates as such, with covariance structure considered.
result Precise three-step phase transition observed in SGD behavior: ballistic, diffusive, then random.

New theory improves diffusion model convergence for generating data.

problem Improving convergence of diffusion models for data generation.
method Developed a non-asymptotic convergence theory for probability flow ODEs.
result Proves d/εd/\varepsilon iterations suffice for approximating target distributions.

There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al. introduced a sampling-based class of methods that are 'well-calibrated' in a specific sense. But the computational c…

2016-05-11abs ↗pdf ↗

GLASS Flows improves flow and diffusion model performance by optimizing sampling efficiency.

problem Efficiency bottleneck in sampling Markov transitions for flow and diffusion models.
method Introduces GLASS Flows, a new sampling paradigm that simulates a 'flow matching model within a flow matching model' to sample Markov transitions efficiently.
result Eliminates the trade-off between stochastic evolution and efficiency in large-scale text-to-image models.

CT-OT Flow estimates continuous-time dynamics from discrete snapshots.

problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.

Neural Ordinary Differential Equations (N-ODEs) are a powerful building block for learning systems, which extend residual networks to a continuous-time dynamical system. We propose a Bayesian version of N-ODEs that enables well-calibrated quantification of prediction uncertainty, while maintaining the expressive power …

2019-12-02abs ↗pdf ↗

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.

Improved analysis for diffusion models reduces KL divergence error dependence on data dimension and discretization step size.

problem Analyze the convergence of diffusion-based generative models under minimal assumptions.
method Model the generation process as a composition of reverse ODE and noising steps, leveraging Wasserstein-type error control and noise addition.
result Achieved a linear dependence on data dimension and improved dependence on discretization step size for KL divergence error.

SignSGD analysis quantifies its effects in high dimensions.

problem Understanding signSGD's effects in high-dimensional settings.
method High-dimensional analysis of signSGD, deriving SDE and ODE for risk.
result Quantification of signSGD's effects: effective learning rate, noise compression, diagonal preconditioning, gradient noise reshaping.

JKO-iFlow uses neural ODEs to improve generative models with reduced memory and training complexity.

problem Efficiently training deep generative models in high dimensions with reduced memory and training complexity.
method JKO scheme inspired neural ODE flow network with adaptive time reparameterization.
result JKO-iFlow achieves competitive performance compared to existing models at reduced computational and memory cost.

A novel score-based method solves high-dimensional Fokker-Planck equations with improved accuracy and speed.

problem High-dimensional Fokker-Planck equations suffer from the curse of dimensionality, leading to numerical errors and slow sampling.
method Score-based Physics-Informed Neural Networks (PINNs) that fit the score function in SDEs, using three methods: Score Matching, Sliced Score Matching, and Score-PINN.
result The score-based method outperforms traditional Monte Carlo and vanilla PINNs in high-dimensional settings, offering faster sampling and reduced errors.

We introduce the geodesic walk for sampling Riemannian manifolds and apply it to the problem of generating uniform random points from polytopes in R^n specified by m inequalities. The walk is a discrete-time simulation of a stochastic differential equation (SDE) on the Riemannian manifold equipped with the metric induc…

2016-06-15abs ↗pdf ↗

Reflected Diffusion Models improve on score-based models by incorporating data constraints.

problem Numerical error in score-based models leads to unnatural samples.
method Reverses a reflected stochastic differential equation on data support, learning perturbed score function through generalized score matching loss.
result Improves sample quality and fidelity without architectural modifications.

We convert deterministic flow models to stochastic samplers.

problem Deterministic flow models are sensitive to errors and cannot condition on intermediate states.
method Transform ODEs into SDEs with the same marginal distributions.
result Empirically outperforms deterministic samplers and controls generation diversity.

The one-dimensional SDE with non Lipschitz diffusion coefficient dXt=b(Xt)dt+σXtγdBt, X0=x, γ<1dX_{t} = b(X_{t})dt + σX_{t}^γ dB_{t}, \ X_{0}=x, \ γ<1 is widely studied in mathematical finance. Several works have proposed asymptotic analysis of densities and implied volatilities in models involving instances of this equation, based on a careful i…

2014-04-17abs ↗pdf ↗

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.

Consistency models accelerate generation with theoretical guarantees.

problem Empirical success of consistency models without theoretical justification.
method Theoretical analysis of consistency models mapping inputs to arbitrary points.
result Achieve KL divergence of order O(ε2) O(\varepsilon^2) with $ O\left(\log\left(\frac{d}{\varepsilon} ight) ight) $ iterations.

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.

TFM trains Neural SDEs without backpropagation, improving clinical time series modeling.

problem Modeling irregularly sampled time series in medicine.
method Trajectory Flow Matching (TFM) using flow matching for generative modeling.
result TFM improves performance on clinical time series datasets.