A Note on the PAC Bayesian Theorem
Andreas Maurer
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.
Create a lesson
Related papers
Calibrated RF-Fingerprinting Under Interference With Heterogeneous Transmission Protocols
Tariq Abdul-Quddoos, Xiangfang Li, Lijun Qian
Video DeltaNet: A Video-Native Hybrid Attention for Livestream Video Generation
Haocheng Xi, Yiming Xie, Hexu Zhao et al.
Don't Mask the Environment: Observation Supervision Changes How Agents Explore Under RL
Juzheng Zhang, Disha Makhija, Manoj Ghuhan Arivazhagan et al.
RISC-V and machine learning: a survey
Shriman Keshri, Apparna Singh, Chinmaya Kumar Palo et al.
Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms
Sambit Mishra, Yingying Wang, Christine K. Johnson et al.
Multi-center Medical Data Mining with FL-Net - A One-stop Shop for Federated Learning
Simon Süwer, Julian Klemm, Elisa Acitelli et al.