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.
New method speeds up SDE inference by matching moments to FPK equation.
problem Efficiency of sampling schemes in high-dimensional SDEs.
method Direct approximation of Fokker-Planck-Kolmogorov equation by matching moments.
result Fast, scalable inference in high-dimensional latent spaces.
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.
We introduce a novel paradigm for learning non-parametric drift and diffusion functions for stochastic differential equation (SDE). The proposed model learns to simulate path distributions that match observations with non-uniform time increments and arbitrary sparseness, which is in contrast with gradient matching that…
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.
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 L2 loss and regularity conditions. Simulation-free VI closes the approximation gap in latent SDEs
problem Recovering dynamical systems from noisy observations
method Helmholtz-SDE
result Recovers dynamics more faithfully than prior methods
Simplified analysis of diffusion models using discrete random variables.
problem Theoretical analysis of diffusion models is complex and requires rigorous proofs.
method Simplified framework for analyzing Euler--Maruyama discretization of VP-SDEs using Grönwall's inequality.
result Standard Gaussian noise can be replaced by discrete random variables without sacrificing convergence guarantee.
Neural SDEs model suicide risk with compact state space constraints.
problem Modeling suicide risk with irregular, noisy, and partially observed data.
method Developed neural SDEs confined to compact state spaces, addressing domain constraints and numerical stability.
result Improved forecasts and optimization dynamics over standard models on EMA datasets.
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.
Develops a deterministic method to approximate NSDEs for better uncertainty quantification.
problem Computational infeasibility of obtaining well-calibrated uncertainty from NSDEs.
method Bidimensional moment matching algorithm for approximating NSDE transition kernel.
result Deterministic approximation improves uncertainty calibration and prediction accuracy.
It is well-known from the work of Schönbucher (2005) that the marginal laws of a loss process can be matched by a unit increasing time inhomogeneous Markov process, whose deterministic jump intensity is called local intensity. The Stochastic Local Intensity (SLI) models such as the one proposed by Arnsdorf and Halperin…
NANSDE-Net models time series with memory using neural ARMA-type noise.
problem Modeling time series with long- or short-memory characteristics.
method Developed NANSDE-Net, a generative model that incorporates Neural Network-kernel ARMA-type noise.
result NANSDE-Net matches or outperforms existing models in reproducing long- and short-memory features of data.
Proximal Diffusion Models improve generative model efficiency.
problem Improving generative model efficiency and accuracy.
method Developed Proximal Diffusion Models using proximal maps instead of scores.
result Proximal Diffusion Models achieve faster convergence and higher accuracy.
Neural networks improve financial derivative pricing accuracy.
problem Improving accuracy in financial derivative pricing.
method Use neural networks to model drift and volatility in SDE models, optimize using SGD for European options and PDE for American options.
result Neural network models outperform traditional models in pricing derivatives.
Efficiently trains forward processes to minimize generative trajectories curvature.
problem High curvature of generative trajectories slows down sampling speed.
method Trains forward process to minimize curvature without ODE/SDE simulation.
result Lower curvature than previous models, decreased sampling costs.
Study on neural network initialization with shaped infinite depth-and-width networks.
problem Understanding the distribution of random covariance matrices in shaped infinite-depth-and-width networks.
method Introduced the Neural Covariance SDE to model the distribution of the random covariance matrix.
result Identified the precise scaling of the activation function necessary for a non-trivial limit.
Generative model for Lévy area improves SDE simulation accuracy.
problem Simulating Lévy areas for high-order SDEs is challenging due to non-Gaussian nature and lack of fast sampling algorithms.
method LévyGAN, a deep-learning model with a GNN-inspired architecture, generates approximate samples of Lévy area.
result LévyGAN matches all joint and conditional odd moments exactly and achieves state-of-the-art performance in 4D Brownian motion.
DSB approximates SB problem for faster generative modeling.
problem Fast generation from complex data distributions.
method Entropy-regularized optimal transport on path spaces.
result DSB yields faster convergence to data distribution.
New method DDVI improves posterior inference for deep Gaussian processes.
problem Inference of inducing points in DGPs is challenging and biased.
method DDVI uses denoising diffusion SDE and score matching for posterior approximation.
result Empirically shows DDVI outperforms baseline methods in inducing point inference.
New SDEs use G-Brownian motion, extending mean-field models.
problem Extending mean-field models to new types of stochastic processes.
method Introduced G-SDEs with coefficients dependent on current state and solution as random variable. result Validated new SDE framework for complex stochastic systems.
PMM uses Bayesian inference to generate data from noisy approximations.
problem Creating flexible generative models for various data types.
method Bayesian inference and conjugate pairs of distributions.
result PMM achieves performance competitive with existing generative models.
Study on the smoothness of solutions to a specific type of stochastic differential equation.
problem Regularity of solutions to mean-field G-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.
New method trains reflected Schrödinger bridges without complex derivatives.
problem Training reflected Schrödinger bridges efficiently in high dimensions.
method Partially simulation-free framework with new sampling method.
result Generative performance maintained or slightly improved with reflected dynamics.
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.
New SDE model for continuous-time reinforcement learning.
problem Modeling exploration in continuous-time reinforcement learning.
method Introduced grid-sampling SDE as a proxy model.
result Wellposedness of the SDE in the presence of jumps.
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.
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.
Sig-SDE model integrates signatures with SDEs for financial data.
problem Calibrating models to exotic financial products with non-linear dependencies.
method Integrating signatures from stochastic analysis with neural SDEs.
result Sig-SDE provides theoretical guarantees for convergence.
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.
New method learns SDEs without integrators, speeding up computation.
problem Computational expense in learning SDEs using neural networks.
method Importance-sampling estimator for SDEs, leveraging parallelism.
result Lower-variance gradient estimates and massive computation time reductions.
Stochastic normalizing flows use SDEs for efficient training and sampling.
problem Efficient maximum likelihood estimation and variational inference.
method Continuous normalizing flows extended with stochastic differential equations (SDEs) and rough path theory.
result Stochastic normalizing flows enable efficient training and sampling from complex distributions.
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…
Proposes neural SDEs with change points for better time series modeling.
problem Restrictions in modeling time series with distributional shift.
method Generative adversarial networks (GANs) for SDEs and change point detection.
result Jointly learns change points and SDE model parameters.
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 method identifies SDE drift and diffusion from temporal data.
problem Learning SDE parameters from temporal data, especially in noisy or incomplete data.
method Entropy-regularized optimal transport, APPEX algorithm.
result Can almost always recover drift and diffusion from temporal marginals.
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 are interested in strong approximations of one-dimensional SDEs which have non-Lipschitz coefficients and which take values in a domain. Under a set of general assumptions we derive an implicit scheme that preserves the domain of the SDEs and is strongly convergent with rate one. Moreover, we show that this general …
Diffusion models converge linearly to complex data manifolds.
problem Sampling from high-dimensional complex data distributions.
method Score-matching generative models with novel integration scheme.
result Linear convergence in KL divergence to intrinsic dimension d. 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…
Neural SDEs reduce variance in stochastic simulations.
problem Efficiency of Monte Carlo simulations in finance.
method Use neural SDEs with control variates parameterized by neural networks.
result Prove optimality conditions for variance reduction in SDEs with infinite activity.
NSFs learn SDE transition laws for efficient sampling.
problem Efficiently sampling between arbitrary time points in SDEs.
method Conditional normalising flows with architectural constraints.
result Up to two orders of magnitude speed-ups at large time gaps.
We present an improved analysis of the Euler-Maruyama discretization of the Langevin diffusion. Our analysis does not require global contractivity, and yields polynomial dependence on the time horizon. Compared to existing approaches, we make an additional smoothness assumption, and improve the existing rate from $O(η)…
New schemes for SDEs on manifolds keep solutions close to the manifold.
problem Solving SDEs constrained to manifolds in high accuracy.
method Geometrically invariant numerical schemes that remain close to the manifold.
result The schemes converge under standard assumptions and outperform existing methods.
GraphBSI generates graphs by refining a belief in continuous space, outperforming existing models.
problem Generating discrete, unordered graph data is challenging for traditional models.
method GraphBSI uses Bayesian Sample Inference (BSI) to iteratively refine a belief over graph distribution parameters.
result GraphBSI outperforms existing one-shot graph generative models on molecular and synthetic graph generation benchmarks.
Generates consistent IV surfaces using VAEs and SDE models.
problem Creating arbitrage-free IV surfaces from historical data.
method Combining VAEs with SDE models for parameter distribution, sampling, and decoding.
result Superior out-of-sample performance of the refined VAE model.