Related papers: A control variate approach based on a defect-type …
This paper introduces two variational inference approaches for infinite-dimensional inverse problems, developed through gradient descent with a constant learning rate. The proposed methods enable efficient approximate sampling from the…
Stochastic variance reduced gradient (SVRG) is a popular variance reduction technique for accelerating stochastic gradient descent (SGD). We provide a first analysis of the method for solving a class of linear inverse problems in the lens…
In this paper we study the mixed virtual element approximation to an elliptic optimal control problem with boundary observations. The objective functional of this type of optimal control problem contains the outward normal derivatives of…
Though ubiquitous as first-principles models for conservative phenomena, Hamiltonian systems present numerous challenges for model reduction even in relatively simple, linear cases. Here, we present a method for the projection-based model…
Methods for generating sequences of surrogates approximating fine scale models of two-phase random heterogeneous media are presented that are designed to adaptively control the modeling error in key quantities of interest (QoIs). For…
Techniques for reducing the variance of gradient estimates used in stochastic programming algorithms for convex finite-sum problems have received a great deal of attention in recent years. By leveraging dissipativity theory from control, we…
We develop an approach to risk minimization and stochastic optimization that provides a convex surrogate for variance, allowing near-optimal and computationally efficient trading between approximation and estimation error. Our approach…
This paper investigates a new class of homogeneous stochastic control problems with cone control constraints, extending the classical homogeneous stochastic linear-quadratic (LQ) framework to encompass nonlinear system dynamics and…
We study the large deviations principle for locally periodic stochastic differential equations with small noise and fast oscillating coefficients. There are three possible regimes depending on how fast the intensity of the noise goes to…
A central question in numerical homogenization of partial differential equations with multiscale coefficients is the accurate computation of effective quantities, such as the homogenized coefficients. Computing homogenized coefficients…
This work addresses the finite-horizon robust covariance control problem for discrete-time, partially observable, linear system affected by random zero mean noise and deterministic but unknown disturbances restricted to lie in what is…
We prove convergence of the proximal policy gradient method for a class of constrained stochastic control problems with control in both the drift and diffusion of the state process. The problem requires either the running or terminal cost…
Results obtained with stochastic methods have an inherent uncertainty due to the finite number of samples that can be achieved in practice. In lattice QCD this problem is particularly salient in some observables like, for instance,…
In this paper, we propose a class of discrete-time approximation schemes for stochastic optimal control problems under the $G$-expectation framework. The proposed schemes are constructed recursively based on piecewise constant policy. We…
Direct methods for the simulation of optimal control problems apply a specific discretization to the dynamics of the problem, and the discrete adjoint method is suitable to calculate corresponding conditions to approximate an optimal…
Scenario reduction algorithms can be an effective means to provide a tractable description of the uncertainty in optimal control problems. However, they might significantly compromise the performance of the controlled system. In this paper,…
A popular method for variance reduction in observational causal inference is propensity-based trimming, the practice of removing units with extreme propensities from the sample. This practice has theoretical grounding when the data are…
In 2018, Bourgain pioneered a novel perturbative harmonic-analytic approach to the stochastic homogenization theory of discrete elliptic equations with weakly random i.i.d. coefficients. The approach was subsequently refined to show that…
Approximate inference in complex probabilistic models such as deep Gaussian processes requires the optimisation of doubly stochastic objective functions. These objectives incorporate randomness both from mini-batch subsampling of the data…
Sampling methods (e.g., node-wise, layer-wise, or subgraph) has become an indispensable strategy to speed up training large-scale Graph Neural Networks (GNNs). However, existing sampling methods are mostly based on the graph structural…