Simple proof of the risk bound for denoising by exponential weights for asymmetric noise distributions

12/25/2022
by   Arnak S. Dalalyan, et al.
0

In this note, we consider the problem of aggregation of estimators in order to denoise a signal. The main contribution is a short proof of the fact that the exponentially weighted aggregate satisfies a sharp oracle inequality. While this result was already known for a wide class of symmetric noise distributions, the extension to asymmetric distributions presented in this note is new.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2022

Sharp Inequalities of Bienaymé-Chebyshev and GaußType for Possibly Asymmetric Intervals around the Mean

Gauß(1823) proved a sharp upper bound on the probability that a random v...
research
02/21/2020

A note on Stein equation for weighted sums of independent χ^2 distributions

This note provides the Stein equation for weighted sums of independent χ...
research
06/25/2018

Exponential weights in multivariate regression and a low-rankness favoring prior

We establish theoretical guarantees for the expected prediction error of...
research
05/17/2018

Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem

For the Asymmetric Traveling Salesman Problem (ATSP), it is known that t...
research
10/29/2019

Sine-skewed toroidal distributions and their application in protein bioinformatics

In the bioinformatics field, there has been a growing interest in modell...
research
05/16/2007

Lasso type classifiers with a reject option

We consider the problem of binary classification where one can, for a pa...
research
10/10/2022

Centre-free kurtosis orderings for asymmetric distributions

The concept of kurtosis is used to describe and compare theoretical and ...

Please sign up or login with your details

Forgot password? Click here to reset