PAC-Bayesian aggregation of affine estimators
From MaRDI portal
Abstract: Aggregating estimators using exponential weights depending on their risk appears optimal in expectation but not in probability. We use here a slight overpenalization to obtain oracle inequality in probability for such an explicit aggregation procedure. We focus on the fixed design regression framework and the aggregation of affine estimators and obtain results for a large family of affine estimators under a non necessarily independent sub-Gaussian noise assumptions.
Recommendations
Cited in
(10)- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Optimal bounds for aggregation of affine estimators
- Aggregated estimators and empirical complexity for least square regression
- Sharp oracle inequalities for aggregation of affine estimators
- Fully Bayesian aggregation
- PAC-Bayesian risk bounds for group-analysis sparse regression by exponential weighting
- Aggregation of affine estimators
- A PAC-Bayes Bound for Tailored Density Estimation
- scientific article; zbMATH DE number 7625186 (Why is no real title available?)
- Simple proof of the risk bound for denoising by exponential weights for asymmetric noise distributions
This page was built for publication: PAC-Bayesian aggregation of affine estimators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417440)