Research map / Learning theory and algorithms / Kernels and regression theory
Fast Rates for General Unbounded Loss Functions: From ERM to Generalized Bayes
Peter D. Grünwald, Nishant A. Mehta
Read the paperCheck your idea against 137,217 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
- Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learning (ICML 2021 · similarity 0.89)
- Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm (NeurIPS 2022 · similarity 0.89)
- PAC-Bayes-Chernoff bounds for unbounded losses (NeurIPS 2024 · similarity 0.89)
- More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity (JMLR 2024 · similarity 0.89)
- Exactly Tight Information-theoretic Generalization Bounds via Binary Jensen-Shannon Divergence (ICML 2025 · similarity 0.88)
- Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.86)
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.
