Two-sided exponential concentration bounds for Bayes error rate and Shannon entropy
Author(s)Honorio, Jean; Jaakkola, Tommi S.
MetadataShow full item record
We provide a method that approximates the Bayes error rate and the Shannon entropy with high probability. The Bayes error rate approximation makes possible to build a classifier that polynomially approaches Bayes error rate. The Shannon entropy approximation provides provable performance guarantees for learning trees and Bayesian networks from continuous variables. Our results rely on some reasonable regularity conditions of the unknown probability distributions, and apply to bounded as well as unbounded variables.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal of Machine Learning Research
Association for Computing Machinery (ACM)
Honorio, Jean, and Tommi Jaakkola. "Two-sided exponential concentration bounds for Bayes error rate and Shannon entropy." Journal of Machine Learning Research W&CP 28(3): 459–467 (2013).
Final published version