English

A Note on the PAC Bayesian Theorem

Machine Learning 2007-05-23 v1 Artificial Intelligence

Abstract

We prove general exponential moment inequalities for averages of [0,1]-valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on the sample count in the enumerator of the PAC Bayesian bound is halved.

Keywords

Cite

@article{arxiv.cs/0411099,
  title  = {A Note on the PAC Bayesian Theorem},
  author = {Andreas Maurer},
  journal= {arXiv preprint arXiv:cs/0411099},
  year   = {2007}
}

Comments

9 pages