Related papers: Theory and Algorithms for Diffusion Processes on R…
We consider in this work the convergence of a split-step Euler type scheme (SSM) for the numerical simulation of interacting particle Stochastic Differential Equation (SDE) systems and McKean-Vlasov Stochastic Differential Equations…
Descriptions of complex physical or biological systems often include stochastic contributions, and these are commonly simulated using Wiener processes. In many cases however, non-Gaussian fluctuations may originate from non-Wiener processes…
Simulation of conditioned diffusion processes is an essential tool in inference for stochastic processes, data imputation, generative modelling, and geometric statistics. Whilst simulating diffusion bridge processes is already difficult on…
We consider the problem of distributed mean estimation (DME), in which $n$ machines are each given a local $d$-dimensional vector $x_v \in \mathbb{R}^d$, and must cooperate to estimate the mean of their inputs $\mu = \frac 1n\sum_{v = 1}^n…
We consider the approximation of stochastic differential equations (SDEs) with non-Lipschitz drift or diffusion coefficients. We present a modified explicit Euler-Maruyama discretisation scheme that allows us to prove strong convergence,…
We develope a perturbation theory for stochastic differential equations (SDEs) by which we mean both stochastic ordinary differential equations (SODEs) and stochastic partial differential equations (SPDEs). In particular, we estimate the $…
We consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in Euclidean space, where the task is to solve Riemannian optimization problem with only noisy objective function evaluations. Towards this, our main…
We investigate a fully discrete finite element approximation for the stochastic Kuramoto-Sivashinsky equation, combining the standard finite element methods in spatial discretization with the implicit Euler-Maruyama scheme in time. Rigorous…
Understanding the behavior of stochastic gradient methods is a central problem in modern machine learning. Recent work has highlighted diagonal linear networks as a simplified yet expressive setting for analyzing the optimization and…
In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity that aim to recover man…
The stochastic gradient descent (SGD) algorithm is the algorithm we use to train neural networks. However, it remains poorly understood how the SGD navigates the highly nonlinear and degenerate loss landscape of a neural network. In this…
This paper focus on investigating the distributed Riemannian stochastic optimization problem on the Stiefel manifold for multi-agent systems, where all the agents work collaboratively to optimize a function modeled by the average of their…
Computing sample means on Riemannian manifolds is typically computationally costly as exemplified by computation of the Fr\'echet mean which often requires finding minimizing geodesics to each data point for each step of an iterative…
Latent neural stochastic differential equations (SDEs) have recently emerged as a promising approach for learning generative models from stochastic time series data. However, they systematically underestimate the noise level inherent in…
The theory of slow invariant manifolds (SIMs) is the foundation of various model-order reduction techniques for dissipative dynamical systems with multiple time-scales, e.g. in chemical kinetic models. The construction of SIMs and many…
Manifolds discovered by machine learning models provide a compact representation of the underlying data. Geodesics on these manifolds define locally length-minimising curves and provide a notion of distance, which are key for reduced-order…
We introduce Statistical Flow Matching (SFM), a novel and mathematically rigorous flow-matching framework on the manifold of parameterized probability measures inspired by the results from information geometry. We demonstrate the…
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…
Stochastic gradient descent is a simple approach to find the local minima of a cost function whose evaluations are corrupted by noise. In this paper, we develop a procedure extending stochastic gradient descent algorithms to the case where…
We study stochastic differential equations (SDEs) of McKean-Vlasov type with distribution dependent drifts and driven by pure jump L\'{e}vy processes. We prove a uniform in time propagation of chaos result, providing quantitative bounds on…