Entropy Bounds for Restricted Convex Hulls
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.
Cite
Text
Koltchinskii. "Entropy Bounds for Restricted Convex Hulls." Annual Conference on Computational Learning Theory, 2003. doi:10.1007/978-3-540-45167-9_59Markdown
[Koltchinskii. "Entropy Bounds for Restricted Convex Hulls." Annual Conference on Computational Learning Theory, 2003.](https://mlanthology.org/colt/2003/koltchinskii2003colt-entropy/) doi:10.1007/978-3-540-45167-9_59BibTeX
@inproceedings{koltchinskii2003colt-entropy,
title = {{Entropy Bounds for Restricted Convex Hulls}},
author = {Koltchinskii, Vladimir},
booktitle = {Annual Conference on Computational Learning Theory},
year = {2003},
pages = {741-742},
doi = {10.1007/978-3-540-45167-9_59},
url = {https://mlanthology.org/colt/2003/koltchinskii2003colt-entropy/}
}