arXiv · 0803.2839
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.
Explore related subjects
Keep this discovery
Arnak Dalalyan, Alexandre Tsybakov. 2013-03-22. Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity. https://doi.org/10.1007/s10994-008-5051-0
Cite the original work for its findings. Save a collection to share your selection of sources.