all AI news
Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficulty. (arXiv:2210.11289v1 [cs.LG])
Oct. 21, 2022, 1:12 a.m. | Felix Biggs, Benjamin Guedj
cs.LG updates on arXiv.org arxiv.org
We introduce a modified version of the excess risk, which can be used to
obtain tighter, fast-rate PAC-Bayesian generalisation bounds. This modified
excess risk leverages information about the relative hardness of data examples
to reduce the variance of its empirical counterpart, tightening the bound. We
combine this with a new bound for $[-1, 1]$-valued (and potentially
non-independent) signed losses, which is more favourable when they empirically
have low variance around $0$. The primary new technical tool is a novel result …
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Data Engineer
@ Chubb | Simsbury, CT, United States
Research Analyst , NA Light Vehicle Powertrain Forecasting
@ S&P Global | US - MI - VIRTUAL
Sr. Data Scientist - ML Ops Job
@ Yash Technologies | Indore, IN
Alternance-Data Management
@ Keolis | Courbevoie, FR, 92400