Research map / Learning theory and algorithms / Sample complexity
Learning via Wasserstein-Based High Probability Generalisation Bounds
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
- Learning via Surrogate PAC-Bayes (NeurIPS 2024 · similarity 0.91)
- Block-Sample MAC-Bayes Generalization Bounds (ICLR 2026 · similarity 0.89)
- PAC-Bayes Un-Expected Bernstein Inequality (NeurIPS 2019 · similarity 0.89)
- Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound (NeurIPS 2024 · similarity 0.88)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (NeurIPS 2024 · similarity 0.88)
- PAC-Bayes-Chernoff bounds for unbounded losses (NeurIPS 2024 · similarity 0.88)
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.