Computer Science – Learning
Scientific paper
2004-11-30
Computer Science
Learning
9 pages
Scientific paper
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.
No associations
LandOfFree
A Note on the PAC Bayesian Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on the PAC Bayesian Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on the PAC Bayesian Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-13831