Sharper convergence bounds of Monte Carlo Rademacher Averages through Self-Bounding functions

10/22/2020
by   Leonardo Pellegrina, et al.
0

We derive sharper probabilistic concentration bounds for the Monte Carlo Empirical Rademacher Averages (MCERA), which are proved through recent results on the concentration of self-bounding functions. Our novel bounds allow obtaining sharper bounds to (Local) Rademacher Averages. We also derive novel variance-aware bounds for the special case where only one vector of Rademacher random variables is used to compute the MCERA. Then, we leverage the framework of self-bounding functions to derive novel probabilistic bounds to the supremum deviations, that may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2021

Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples

We introduce a class of γ-negatively dependent random samples. We prove ...
research
06/17/2022

A Note on Monte Carlo Integration in High Dimensions

Monte Carlo integration is a commonly used technique to compute intracta...
research
05/27/2020

Demystifying Orthogonal Monte Carlo and Beyond

Orthogonal Monte Carlo (OMC) is a very effective sampling algorithm impo...
research
09/06/2021

Bounding Means of Discrete Distributions

We introduce methods to bound the mean of a discrete distribution (or fi...
research
05/28/2021

Influence of sampling on the convergence rates of greedy algorithms for parameter-dependent random variables

The main focus of this article is to provide a mathematical study of the...
research
06/25/2019

Probabilistic Error Analysis for Inner Products

Probabilistic models are proposed for bounding the forward error in the ...
research
11/09/2021

Bounding Treatment Effects by Pooling Limited Information across Observations

We provide novel bounds on average treatment effects (on the treated) th...

Please sign up or login with your details

Forgot password? Click here to reset