Related papers: An Optimal Gauss-Markov Approximation for a Proces…
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify…
The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation…
A formula for the transition density of a Markov process defined by an infinite-dimensional stochastic equation is given in terms of the Ornstein--Uhlenbeck bridge and a useful lower estimate on the density is provided. As a consequence,…
Stochastic gradient descent is a classic algorithm that has gained great popularity especially in the last decades as the most common approach for training models in machine learning. While the algorithm has been well-studied when…
We study rates of convergence in central limit theorems for partial sum of functionals of general stationary and non-stationary Gaussian sequences, using optimal tools from analysis on Wiener space. We apply our result to study drift…
This work considers stochastic Galerkin approximations of linear elliptic partial differential equations (PDEs) with stochastic forcing terms and stochastic diffusion coefficients, that cannot be bounded uniformly away from zero and…
An explicit first-order drift-randomized Milstein scheme for a regime switching stochastic differential equation is proposed and its bi-stability and rate of strong convergence are investigated for a non-differentiable drift coefficient.…
Piecewise $\alpha$-stable Ornstein-Uhlenbeck (OU) processes arising in queue networks usually do not have an explicit dissipation, which makes the related numerical methods such as Euler-Maruyama (EM) scheme more difficult to analyze. We…
We give a new take on the error analysis of approximations of stochastic differential equations (SDEs), utilizing and developing the stochastic sewing lemma of L\^e (2020). This approach allows one to exploit regularization by noise effects…
We present an exact solution for one-dimensional overdamped dynamics near a hard wall, allowing us to connect steady-state distributions under confinement with the extreme value statistics of unconfined stochastic processes. This mapping…
In this paper, we investigate the parameter estimation for threshold Ornstein$\mathit{-}$Uhlenbeck processes. Least squares method is used to obtain continuous-type and discrete-type estimators for the drift parameters based on continuous…
We consider a stochastic differential equation with additive fractional noise with Hurst parameter $H>1/2$, and a non-linear drift depending on an unknown parameter. We show the Local Asymptotic Normality property (LAN) of this parametric…
We present a deep learning model, DE-LSTM, for the simulation of a stochastic process with an underlying nonlinear dynamics. The deep learning model aims to approximate the probability density function of a stochastic process via numerical…
Gradient optimization algorithms using epochs, that is those based on stochastic gradient descent without replacement (SGDo), are predominantly used to train machine learning models in practice. However, the mathematical theory of SGDo and…
The aim of this paper is to establish the uniform convergence of the densities of a sequence of random variables, which are functionals of an underlying Gaussian process, to a normal density. Precise estimates for the uniform distance are…
We provide a numerically robust and fast method capable of exploiting the local geometry when solving large-scale stochastic optimisation problems. Our key innovation is an auxiliary variable construction coupled with an inverse Hessian…
This paper studies minimax optimization problems defined over infinite-dimensional function classes of overparameterized two-layer neural networks. In particular, we consider the minimax optimization problem stemming from estimating linear…
Using lattice approximations of Euclidean space, we develop a way to approximate stable processes that are represented by stochastic integrals over Euclidean space. Via a stable version of the Lindeberg-Feller Theorem we show that the…
Semidiscrete optimal transport is a challenging generalization of the classical transportation problem in linear programming. The goal is to design a joint distribution for two random variables (one continuous, one discrete) with fixed…
We provide a general theorem on the asymptotic behavior of stochastic processes that conform to a relaxed supermartingale condition. The distinguishing feature of our result is that it provides quantitative convergence guarantees at a much…