Research map / Learning theory and algorithms / Sample complexity
Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learning
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
- Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm (NeurIPS 2022 · similarity 0.87)
- Exactly Tight Information-theoretic Generalization Bounds via Binary Jensen-Shannon Divergence (ICML 2025 · similarity 0.86)
- PAC-Bayes-Chernoff bounds for unbounded losses (NeurIPS 2024 · similarity 0.85)
- Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood (NeurIPS 2024 · similarity 0.85)
- Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes (NeurIPS 2025 · similarity 0.85)
- On the Asymptotic Distribution of the Minimum Empirical Risk (ICML 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.
