Related papers: Optimal artificial boundary condition for random e…
In this paper we present a novel approach for the prescription of high order boundary conditions when approximating the solution of the Euler equations for compressible gas dynamics on curved moving domains. When dealing with curved…
Recently, Arjevani et al. [1] established a lower bound of iteration complexity for the first-order optimization under an $L$-smooth condition and a bounded noise variance assumption. However, a thorough review of existing literature on…
We consider an $n$ agents distributed optimization problem with imperfect information characterized in a parametric sense, where the unknown parameter can be solved by a distinct distributed parameter learning problem. Though each agent…
In this paper, we propose a new, simplified high probability analysis of AdaGrad for smooth, non-convex problems. More specifically, we focus on a particular accelerated gradient (AGD) template (Lan, 2020), through which we recover the…
We consider the isoparametric finite element method (FEM) for the Poisson equation in a smooth domain with the homogeneous Dirichlet boundary condition. Because the boundary is curved, standard triangulated meshes do not exactly fit it.…
This paper studies an integrated learning and optimization problem in which a prediction model estimates the right-hand-side parameters of a linear program (LP) using a contextual vector. Considering that such a prediction alters the…
We study the convergence of a random iterative sequence of a family of operators on infinite dimensional Hilbert spaces, inspired by the Stochastic Gradient Descent (SGD) algorithm in the case of the noiseless regression, as studied in [1].…
We present a priori and a posteriori error analysis of a high order hybridizable discontinuous Galerkin (HDG) method applied to a semi-linear elliptic problem posed on a piecewise curved, non polygonal domain. We approximate $\Omega$ by a…
A wide variety of articles, starting with the famous paper (Gidas, Ni and Nirenberg in Commun. Math. Phys. 68, 209-243 (1979)) is devoted to the uniqueness question for the semilinear elliptic boundary value problem…
This paper investigates a new approach to estimate the gradient of the conditional probability given the covariates in the binary classification framework. The proposed approach consists in fitting a localized nearest-neighbor logistic…
We give a simplified presentation of the obstacle problem approach to stochastic homogenization for elliptic equations in nondivergence form. Our argument also applies to equations which depend on the gradient of the unknown function. In…
We show that certain linear elliptic equations (and systems) in divergence form with almost periodic coefficients have bounded, almost periodic correctors. This is proved under a new condition we introduce which quantifies the almost…
Recently, Stochastic Gradient Descent (SGD) and its variants have become the dominant methods in the large-scale optimization of machine learning (ML) problems. A variety of strategies have been proposed for tuning the step sizes, ranging…
Stochastic optimization lies at the core of most statistical learning models. The recent great development of stochastic algorithmic tools focused significantly onto proximal gradient iterations, in order to find an efficient approach for…
A preconditioning strategy is proposed for the iterative solve of large numbers of linear systems with parameter-dependent matrix and right-hand side which arise during the computation of solution statistics of stochastic elliptic partial…
We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…
We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $\mu$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in…
We derive optimal estimates in stochastic homogenization of linear elliptic equations in divergence form in dimensions $d\ge 2$. In previous works we studied the model problem of a discrete elliptic equation on $\mathbb{Z}^d$. Under the…
In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms)…
We prove a quantitative, large-scale doubling inequality and large-scale three-ellipsoid inequality for solutions of uniformly elliptic equations with periodic coefficients. These estimates are optimal in terms of the minimal length scale…