Skip to main navigation Skip to search Skip to main content

Aggregation by exponential weighting and sharp oracle inequalities

  • Sorbonne Université

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the present paper, we study the problem of aggregation under the squared loss in the model of regression with deterministic design. We obtain sharp oracle inequalities for convex aggregates defined via exponential weights, under general assumptions on the distribution of errors and on the functions to aggregate. We show how these results can be applied to derive a sparsity oracle inequality.

Original languageEnglish
Title of host publicationLearning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings
PublisherSpringer Verlag
Pages97-111
Number of pages15
ISBN (Print)9783540729259
DOIs
Publication statusPublished - 1 Jan 2007
Externally publishedYes
Event20th Annual Conference on Learning Theory, COLT 2007 - San Diego, CA, United States
Duration: 13 Jun 200715 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4539 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Annual Conference on Learning Theory, COLT 2007
Country/TerritoryUnited States
CitySan Diego, CA
Period13/06/0715/06/07

Fingerprint

Dive into the research topics of 'Aggregation by exponential weighting and sharp oracle inequalities'. Together they form a unique fingerprint.

Cite this