Hedging predictions in machine learning
Alexander Gammerman, Vladimir Vovk

TL;DR
This paper introduces a new hedging technique for machine learning predictions that provides reliable confidence measures and error control, applicable to various algorithms like SVMs and kernel methods.
Contribution
It presents a novel method for producing confidence-aware predictions that are statistically valid and adaptable to multiple machine learning algorithms.
Findings
Provides provably valid confidence measures for predictions
Enables control of prediction error rates
Applicable to a wide range of machine learning methods
Abstract
Recent advances in machine learning make it possible to design efficient prediction algorithms for data sets with huge numbers of parameters. This paper describes a new technique for "hedging" the predictions output by many such algorithms, including support vector machines, kernel ridge regression, kernel nearest neighbours, and by many other state-of-the-art methods. The hedged predictions for the labels of new objects include quantitative measures of their own accuracy and reliability. These measures are provably valid under the assumption of randomness, traditional in machine learning: the objects and their labels are assumed to be generated independently from the same probability distribution. In particular, it becomes possible to control (up to statistical fluctuations) the number of erroneous predictions by selecting a suitable confidence level. Validity being achieved…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
