Related papers: Near-optimal approximation methods for elliptic PD…

This paper presents a detailed theoretical analysis of the three stochastic approximation proximal gradient algorithms proposed in our companion paper [49] to set regularization parameters by marginal maximum likelihood estimation. We prove…

Linear combinations of translations of a single Gaussian, e^{-x^2}, are shown to be dense in L^2(R). Two algorithms for determining the coefficients for the approximations are given, using orthogonal Hermite functions and least squares.…

This paper presents a novel stochastic optimisation methodology to perform empirical Bayesian inference in semi-blind image deconvolution problems. Given a blurred image and a parametric class of possible operators, the proposed…

In this paper we study the numerical method for approximating the random periodic solution of semiliear stochastic evolution equations. The main challenge lies in proving a convergence over an infinite time horizon while simulating…

We study the approximation of stochastic differential equations driven by a fractional Brownian motion with Hurst parameter $H>1/2$. For the mean-square error at a single point we derive the optimal rate of convergence that can be achieved…

In this paper, we propose a method to obtain a constrained approximation of a rational B\'{e}zier curve by a polynomial B\'{e}zier curve. This problem is reformulated as an approximation problem between two polynomial B\'{e}zier curves…

In this work, we consider a non-standard preconditioning strategy for the numerical approximation of the classical elliptic equations with log-normal random coefficients. In \cite{Wan_model}, a Wick-type elliptic model was proposed by…

In the recent article [Hairer, M., Hutzenthaler, M., Jentzen, A., Loss of regularity for Kolmogorov equations, Ann. Probab. 43 (2015), no. 2, 468--527] it has been shown that there exist stochastic differential equations (SDEs) with…

We present a non-conforming least squares method for approximating solutions of second order elliptic problems with discontinuous coefficients. The method is based on a general Saddle Point Least Squares (SPLS) method introduced in previous…

In this paper, we use Proximal Cubic regularized Newton Methods (PCNM) to optimize the sum of a smooth convex function and a non-smooth convex function, where we use inexact gradient and Hessian, and an inexact subsolver for the cubic…

The empirical Bayes $g$-modeling approach via the nonparametric maximum likelihood estimator (NPMLE) is widely used for large-scale estimation and inference in the normal means problem, yet theoretical guarantees for uncertainty…

Bayesian inference is a popular method to build learning algorithms but it is hampered by the fact that its key object, the posterior probability distribution, is often uncomputable. Expectation Propagation (EP) (Minka (2001)) is a popular…

We study an expansion method for high-dimensional parabolic PDEs which constructs accurate approximate solutions by decomposition into solutions to lower-dimensional PDEs, and which is particularly effective if there are a low number of…

We consider Galerkin finite element methods for semilinear stochastic partial differential equations (SPDEs) with multiplicative noise and Lipschitz continuous nonlinearities. We analyze the strong error of convergence for spatially…

Bilevel optimization problems are receiving increasing attention in machine learning as they provide a natural framework for hyperparameter optimization and meta-learning. A key step to tackle these problems is the efficient computation of…

In this paper, we propose a novel kind of numerical approximations to inherit the ergodicity of stochastic Maxwell equations. The key to proving the ergodicity lies in the uniform regularity estimates of the numerical solutions with respect…

Deriving Bayesian inference for exponential random graph models (ERGMs) is a challenging "doubly intractable" problem as the normalizing constants of the likelihood and posterior density are both intractable. Markov chain Monte Carlo (MCMC)…

We are concerned with the homogenization of second-order linear elliptic equations with random coefficient fields. For symmetric coefficient fields with only short-range correlations, quantified through a logarithmic Sobolev inequality for…

We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the…

In this paper we study a type of stochastic McKean-Vlasov equations with non-Lipschitz coefficients. Firstly, by an Euler-Maruyama approximation existence of its weak solutions is proved. And then we observe pathwise uniqueness of its weak…