相关论文: Statistical Error of Numerical Integrators for Und…
Strong approximation errors of both finite element semi-discretization and spatio-temporal full discretization are analyzed for the stochastic Allen-Cahn equation driven by additive noise in space dimension $d \leq 3$. The full…
In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data. Recent work [Xu and Raginsky (2017)] has established a bound on the…
Constrained sampling is an important and challenging task in computational statistics, concerned with generating samples from a distribution under certain constraints. There are numerous types of algorithm aimed at this task, ranging from…
We construct several variational integrators--integrators based on a discrete variational principle--for systems with Lagrangians of the form L = L_A + epsilon L_B, with epsilon << 1, where L_A describes an integrable system. These…
Gradient Langevin dynamics and a variety of its variants have attracted increasing attention owing to their convergence towards the global optimal solution, initially in the unconstrained convex framework while recently even in convex…
We propose to quantify the complexity of non-equilibrium steady state density operators, as well as of long-lived Liouvillian decay modes, in terms of level spacing distribution of their spectra. Based on extensive numerical studies in a…
In this paper, the weak convergence about the discretization error of stochastic iterated integrals in the Skorohod sense are studied, while the integrands and integrators of iterated integrals are supposed to be semimartingales with jumps.…
Adaptive Langevin dynamics is a method for sampling the Boltzmann-Gibbs distribution at prescribed temperature in cases where the potential gradient is subject to stochastic perturbation of unknown magnitude. The method replaces the…
In molecular dynamics, statistics of transitions, such as the mean transition time, are macroscopic observables which provide important dynamical information on the underlying microscopic stochastic process. A direct estimation using…
We propose a new algorithm---Stochastic Proximal Langevin Algorithm (SPLA)---for sampling from a log concave distribution. Our method is a generalization of the Langevin algorithm to potentials expressed as the sum of one stochastic smooth…
The stochastic properties of a Langevin-type Markov process can be extracted from a given time series by a Markov analysis. Also processes that obey a stochastically forced second order differential equation can be analyzed this way by…
In this work, we provide a non-asymptotic convergence analysis of projected gradient descent for physics-informed neural networks for the Poisson equation. Under suitable assumptions, we show that the optimization error can be bounded by…
We present a hybrid a-priori/a-posteriori goal oriented error estimator for a combination of dynamic iteration-based solution of ordinary differential equations discretized by finite elements. Our novel error estimator combines estimates…
In this paper, we propose a new numerical method for the underdamped Langevin diffusion (ULD) and present a non-asymptotic analysis of its sampling error in the 2-Wasserstein distance when the $d$-dimensional target distribution…
Efficient numerical algorithm for stochastic differential equation has been an important object in the research of statistical physics and mathematics for a long time. In this paper we study the highly accurate numerical algorithm of the…
The random batch method provides an efficient algorithm for computing statistical properties of a canonical ensemble of interacting particles. In this work, we study the error estimates of the fully discrete random batch method, especially…
Monte Carlo sampling techniques have broad applications in machine learning, Bayesian posterior inference, and parameter estimation. Often the target distribution takes the form of a product distribution over a dataset with a large number…
This survey will appear as a chapter of the forthcoming book [19]. A U-statistic of order $k$ with kernel $f:\X^k \to \R^d$ over a Poisson process is defined in \cite{ReiSch11} as$$ \sum\_{x\_1, \dots , x\_k \in \eta^k\_{\neq}} f(x\_1,…
We introduce a new class of integrators for stiff ODEs as well as SDEs. These integrators are (i) {\it Multiscale}: they are based on flow averaging and so do not fully resolve the fast variables and have a computational cost determined by…
In this paper we study the effect of stochastic errors on two constrained incremental sub-gradient algorithms. We view the incremental sub-gradient algorithms as decentralized network optimization algorithms as applied to minimize a sum of…