Variance reduction via empirical variance minimization: convergence and complexity

12/13/2017
by   D. Belomestny, et al.
0

In this paper we propose and study a generic variance reduction approach. The proposed method is based on minimization of the empirical variance over a suitable class of zero mean control functionals. We present the corresponding convergence analysis and analyze complexity. Finally some numerical results showing efficiency of the proposed approach are presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

Theoretical guarantees for neural control variates in MCMC

In this paper, we propose a variance reduction approach for Markov chain...
research
10/08/2019

Variance reduction for Markov chains with application to MCMC

In this paper we propose a novel variance reduction approach for additiv...
research
08/16/2020

Variance reduction for dependent sequences with applications to Stochastic Gradient MCMC

In this paper we propose a novel and practical variance reduction approa...
research
10/08/2016

Variance-based regularization with convex objectives

We develop an approach to risk minimization and stochastic optimization ...
research
08/31/2012

On the convergence of maximum variance unfolding

Maximum Variance Unfolding is one of the main methods for (nonlinear) di...
research
07/01/2021

Optimal use of auxiliary information : information geometry and empirical process

We incorporate into the empirical measure the auxiliary information give...
research
01/31/2020

Semi-Exact Control Functionals From Sard's Method

This paper focuses on the numerical computation of posterior expected qu...

Please sign up or login with your details

Forgot password? Click here to reset