Tutorial on Practical Prediction Theory for Classification

We discuss basic prediction theory and its impact on classification success evaluation, implications for learning algorithm design, and uses in learning algorithm execution. This tutorial is meant to be a comprehensive compilation of results which are both theoretically rigorous and quantitatively useful. There are two important implications of the results presented here. The first is that common practices for reporting results in classification should change to use the test set bound. The second is that train set bounds can sometimes be used to directly motivate learning algorithms. [abs] [ pdf ][ bib ] &copy JMLR 2005. ( edit, beta )

Authors

• John Langford

Keywords

No keywords are indexed for this paper.