Related papers: Binomial Approximation to Locally Dependent CDO
Stability and boundedness analysis for vector nonlinear systems with variable delays and coefficients remains challenging due to the conservatism of existing methods. Moreover, estimates of the transient behavior of solution norms remain…
Pseudospectral approximation provides a means to approximate the dynamics of delay differential equations (DDE) by ordinary differential equations (ODE). This article develops a computer-aided algorithm to determine the distance between the…
We present reduced basis approximations and rigorous a posteriori error bounds for the instationary Stokes equations. We shall discuss both a method based on the standard formulation as well as a method based on a penalty approach, which…
Stein's method is applied to obtain a general Cramer-type moderate deviation result for dependent random variables whose dependence is defined in terms of a Stein identity. A corollary for zero-bias coupling is deduced. The result is also…
Numerical approximation of the long time behavior of a stochastic differential equation (SDE) is considered. Error estimates for time-averaging estimators are obtained and then used to show that the stationary behavior of the numerical…
This paper is concerned with the Stein's method associated with a (possibly) asymmetric $\alpha$-stable distribution $Z$, in dimension one. More precisely, its goal is twofold. In the first part, we exhibit a genuine bound for the…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…
In this paper, we propose a distributed stochastic second-order proximal method that enables agents in a network to cooperatively minimize the sum of their local loss functions without any centralized coordination. The proposed algorithm,…
We study the computational complexity of approximating general constrained Markov decision processes. Our primary contribution is the design of a polynomial time $(0,\epsilon)$-additive bicriteria approximation algorithm for finding optimal…
This paper establishes quantitative limit theorems for two classes of Cox point processes, quantifying their convergence to a Poisson point process (PPP). We employ Stein's method for PPP aproximation, leveraging the generator approach and…
Instances of discrete quantum systems coupled to a continuum of oscillators are ubiquitous in physics. Often the continua are approximated by a discrete set of modes. We derive analytical error bounds on expectation values of system…
In this paper we propose local approximation spaces for localized model order reduction procedures such as domain decomposition and multiscale methods. Those spaces are constructed from local solutions of the partial differential equation…
Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…
We use Stein's method to establish the rates of normal approximation in terms of the total variation distance for a large class of sums of score functions of marked Poisson point processes on $\mathbb{R}^d$. As in the study under the weaker…
In this paper we consider the problem of obtaining sharp bounds for the performance of temporal difference (TD) methods with linear function approximation for policy evaluation in discounted Markov decision processes. We show that a simple…
Using Stein's method, we prove an abstract result that yields multivariate central limit theorems with a rate of convergence for time-dependent dynamical systems. As examples we study a model of expanding circle maps and a quasistatic…
In this work we are interested in the construction of numerical methods for high dimensional constrained nonlinear optimization problems by particle-based gradient-free techniques. A consensus-based optimization (CBO) approach combined with…
The recently developed Distributed Block Proximal Method, for solving stochastic big-data convex optimization problems, is studied in this paper under the assumption of constant stepsizes and strongly convex (possibly non-smooth) local…
The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…