Related papers: Convergence Analysis of Sample Average Approximati…
(Stochastic) bilevel optimization is a frequently encountered problem in machine learning with a wide range of applications such as meta-learning, hyper-parameter optimization, and reinforcement learning. Most of the existing studies on…
We study a class of two-stage stochastic programs in which the second stage includes a set of components with uncertain capacity, and the expression for the distribution function of the uncertain capacity includes first-stage variables.…
In this paper we study the homogenization of unsteady Stokes type equations in the periodic setting. The usual Laplace operator involved in the classical Stokes equations is here replaced by a linear elliptic differential operator of…
This paper studies the behavior of singularly perturbed nonlinear differential equations with boundary-layer solutions that do not necessarily converge to an equilibrium. Using the average of the fast variable and assuming the boundary…
Dual averaging and gradient descent with their stochastic variants stand as the two canonical recipe books for first-order optimization: Every modern variant can be viewed as a descendant of one or the other. In the convex regime, these…
Stochastic non-smooth convex optimization constitutes a class of problems in machine learning and operations research. This paper considers minimization of a non-smooth function based on stochastic subgradients. When the function has a…
This paper is concerned with classes of models of stochastic reaction dynamics with time-scales separation. We demonstrate that the existence of the time-scale separation naturally leads to the application of the averaging principle and…
Block coordinate descent methods and stochastic subgradient methods have been extensively studied in optimization and machine learning. By combining randomized block sampling with stochastic subgradient methods based on dual averaging, we…
We propose an abstract framework for the homogenization of random functionals which may contain non-convex terms, based on a two-scale $\Gamma$-convergence approach and a definition of Young measures on micropatterns which encodes the…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
Averaging principle is an effective method for investigating dynamical systems with highly oscillating components. In this paper, we study three types of averaging principle for stochastic complex Ginzburg-Landau equations. Firstly, we…
Orthogonal statistical learning and double machine learning have emerged as general frameworks for two-stage statistical prediction in the presence of a nuisance component. We establish non-asymptotic bounds on the excess risk of orthogonal…
Stochastic iterative methods are useful in a variety of large-scale numerical linear algebraic, machine learning, and statistical problems, in part due to their low-memory footprint. They are frequently used in a variety of applications,…
Considering the constrained stochastic optimization problem over a time-varying random network, where the agents are to collectively minimize a sum of objective functions subject to a common constraint set, we investigate asymptotic…
In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in [Facchinei and Lucidi, 1995] with a modification of the non-monotone line search…
We consider stochastic variational inequality problems where the mapping is monotone over a compact convex set. We present two robust variants of stochastic extragradient algorithms for solving such problems. Of these, the first scheme…
We develop a new tool, the time inhomogeneous Poisson equation in the whole space and with a terminal condition at infinity, to study the asymptotic behavior of the non-autonomous multi-scale stochastic system with irregular coefficients,…
Stochastic localization is a pathwise analysis technique originating from convex geometry. This paper explores certain algorithmic aspects of stochastic localization as a computational tool. First, we unify various existing stochastic…
We investigate three types of averaging principles and the normal deviation for multi-scale stochastic differential equations (in short, SDEs) with polynomial nonlinearity. More specifically, we first demonstrate the strong convergence of…
We propose, analyze, and test a novel continuous data assimilation two-phase flow algorithm for reservoir simulation. We show that the solutions of the algorithm, constructed using coarse mesh observations, converge at an exponential rate…