all AI news
A Note on the Efficient Evaluation of PAC-Bayes Bounds. (arXiv:2209.05188v2 [cs.LG] UPDATED)
Oct. 21, 2022, 1:13 a.m. | Felix Biggs
cs.LG updates on arXiv.org arxiv.org
When utilising PAC-Bayes theory for risk certification, it is usually
necessary to estimate and bound the Gibbs risk of the PAC-Bayes posterior. Many
works in the literature employ a method for this which requires a large number
of passes of the dataset, incurring high computational cost. This manuscript
presents a very general alternative which makes computational savings on the
order of the dataset size.
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Vice President, AI Product Manager
@ JPMorgan Chase & Co. | New York City, United States
Binance Accelerator Program - Data Engineer
@ Binance | Asia