Improved risk tail bounds for on-line algorithms
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.
Available Versions of this Item