Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity - Archive ouverte HAL Access content directly
Journal Articles Machine Learning Year : 2008

Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity

Abstract

We study the problem of aggregation under the squared loss in the model of regression with deterministic design. We obtain sharp PAC-Bayesian risk bounds for aggregates defined via exponential weights, under general assumptions on the distribution of errors and on the functions to aggregate. We then apply these results to derive sparsity oracle inequalities.
Fichier principal
Vignette du fichier
RegAg_JML_rev.pdf (270.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00265651 , version 1 (19-03-2008)
hal-00265651 , version 2 (22-03-2013)

Identifiers

Cite

Arnak S. Dalalyan, Alexandre Tsybakov. Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity. Machine Learning, 2008, 72 (1-2), pp.39-61. ⟨10.1007/s10994-008-5051-0⟩. ⟨hal-00265651v2⟩
176 View
452 Download

Altmetric

Share

Gmail Facebook X LinkedIn More