Abstract
An unsolved problem of bounding the entropy of a “restricted” convex hull of a set in a Hilbert space is discussed. The problem is related to bounding the generalization error of convex combinations of base classifiers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
van der Vaart, A.W., Wellner, J.: Weak Convergence and Empirical Processes. Springer, New York (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koltchinskii, V. (2003). Entropy Bounds for Restricted Convex Hulls. In: Schölkopf, B., Warmuth, M.K. (eds) Learning Theory and Kernel Machines. Lecture Notes in Computer Science(), vol 2777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45167-9_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-45167-9_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40720-1
Online ISBN: 978-3-540-45167-9
eBook Packages: Springer Book Archive