2001 MetricBasedMethodsFor

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Metric-based Model Selection Algorithm, Model Selection, Regularization, Unlabeled Example.

Notes

Cited by

~34 http://scholar.google.com/scholar?cites=248895723839956917

Quotes

Abstract

  • We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea is to impose a metric structure on hypotheses by determining the discrepancy between their predictions across the distribution of unlabeled data. We show how this metric can be used to detect untrustworthy training error estimates, and devise novel model selection strategies that exhibit theoretical guarantees against over-fitting (while still avoiding under-fitting). We then extend the approach to derive a general training criterion for supervised learning — yielding an adaptive regularization method that uses unlabeled data to automatically set regularization parameters. This new criterion adjusts its regularization level to the specific set of training data received, and performs well on a variety of regression and conditional density estimation tasks. The only proviso for these methods is that sufficient unlabeled training data be available.

References


,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2001 MetricBasedMethodsForDale Schuurmans
Finnegan Southey
Metric-based methods for adaptive model selection and regularizationMachine Learning (ML) Subject Areahttp://cs.ualberta.ca/~dale/papers/mlj02.pdf10.1023/A:10139475197412001