2004/11/30 by Andreas Maurer, Maurer, Andreas · 19 citations
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Gaussian Processes and Bayesian Inference #Machine Learning and Algorithms #cs.AI #cs.LG
paper · pdf · doi:10.48550/arxiv.cs/0411099
9 pages
arxiv created 2004/11/30 · arxiv updated 2009/12/01
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.