PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Improved risk tail bounds for on-line algorithms
Nicolò Cesa-Bianchi and Claudio Gentile
In: NIPS 2005, 5-8 Dec 2005, Vancouver, Canada.

There is a more recent version of this eprint available. Click here to view it.


We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result is based on proof techniques that are remarkably different from the standard risk analysis based on uniform convergence arguments.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Poster)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:1235
Deposited By:Nicolò Cesa-Bianchi
Deposited On:28 November 2005

Available Versions of this Item