Research map / Learning theory and algorithms / Kernels and regression theory
PAC-Bayes Learning Bounds for Sample-Dependent Priors
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
- Data-dependent PAC-Bayes priors via differential privacy (NeurIPS 2018 · similarity 0.92)
- Toward Better PAC-Bayes Bounds for Uniformly Stable Algorithms (NeurIPS 2023 · similarity 0.91)
- PAC-Bayes bounds for stable algorithms with instance-dependent priors (NeurIPS 2018 · similarity 0.91)
- PAC-Bayes-Chernoff bounds for unbounded losses (NeurIPS 2024 · similarity 0.89)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (NeurIPS 2024 · similarity 0.88)
- Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes (NeurIPS 2025 · similarity 0.87)
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.