Abstract
This chapter offers key theoretical results that confirm the existence of certain “good” rules. Although the proofs are constructive—we do tell you how you may design such rules—the computational requirements are often prohibitive. Many of these rules are thus not likely to filter down to the software packages and pattern recognition implementations. An attempt at reducing the computational complexity somewhat is described in the section entitled “Simple empirical covering.” Nevertheless, we feel that much more serious work on discovering practical algorithms for empirical risk minimization is sorely needed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Devroye, L., Györfi, L., Lugosi, G. (1996). Complexity Regularization. In: A Probabilistic Theory of Pattern Recognition. Stochastic Modelling and Applied Probability, vol 31. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0711-5_18
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0711-5_18
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6877-2
Online ISBN: 978-1-4612-0711-5
eBook Packages: Springer Book Archive