It is known theoretically that an algorithm cannot be good for an arbitrary prior. We show that in practical terms this also applies to the technique of “cross-validation,” which has been widely regarded as defying this general rule. Numerical examples are analyzed in detail. Their implications to researches on learning algorithms are discussed.

Issue Section:
Note
This content is only available as a PDF.
© 1996 Massachusetts Institute of Technology
1996
You do not currently have access to this content.