Exponential inequality for chaos based on sampling without replacement

08/28/2018
by   P Hodara, et al.
0

We are interested in the behavior of particular functionals, in a framework where the only source of randomness is a sampling without replacement. More precisely the aim of this short note is to prove an exponential concentration inequality for special U-statistics of order 2, that can be seen as chaos.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2020

Recht-Ré Noncommutative Arithmetic-Geometric Mean Conjecture is False

Stochastic optimization algorithms have become indispensable in modern m...
research
02/19/2012

Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences

Randomized algorithms that base iteration-level decisions on samples fro...
research
11/29/2017

Detailed proof of Nazarov's inequality

The purpose of this note is to provide a detailed proof of Nazarov's ine...
research
06/30/2020

Exponential inequalities for sampling designs

In this work we introduce a general approach, based on the mar-tingale r...
research
02/15/2022

A short note on an inequality between KL and TV

The goal of this short note is to discuss the relation between Kullback–...
research
01/05/2023

Another look at Stein's method for Studentized nonlinear statistics with an application to U-statistics

We take another look at using Stein's method to establish uniform Berry-...
research
03/12/2021

Can Single-Shuffle SGD be Better than Reshuffling SGD and GD?

We propose matrix norm inequalities that extend the Recht-Ré (2012) conj...

Please sign up or login with your details

Forgot password? Click here to reset