Research map / Learning theory and algorithms / Sample complexity
PAC-Bayes under potentially heavy tails
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- PAC-Bayes-Chernoff bounds for unbounded losses (NeurIPS 2024 · similarity 0.90)
- PAC-Bayes Learning Bounds for Sample-Dependent Priors (NeurIPS 2020 · similarity 0.87)
- PAC-Bayesian Theory Meets Bayesian Inference (NeurIPS 2016 · similarity 0.87)
- Learning via Wasserstein-Based High Probability Generalisation Bounds (NeurIPS 2023 · similarity 0.87)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (NeurIPS 2024 · similarity 0.86)
- Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound (NeurIPS 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.