Research map / Learning theory and algorithms / Kernels and regression theory

Exponential Generalization Bounds with Near-Optimal Rates for $L_q$-Stable Algorithms

ICLR 2023 · Learning theory and algorithms › Kernels and regression theory · approach: Information-theoretic generalization 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

• $L_2$-Uniform Stability of Randomized Learning Algorithms: Sharper Generalization Bounds and Confidence Boosting (NeurIPS 2023 · similarity 0.93)
• Generalization Bounds for Uniformly Stable Algorithms (NeurIPS 2018 · similarity 0.92)
• Sharper Bounds for Uniformly Stable Algorithms with Stationary Mixing Process (ICLR 2023 · similarity 0.92)
• Algorithmic Stability Unleashed: Generalization Bounds with Unbounded Losses (ICML 2024 · similarity 0.91)
• Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.90)
• Exactly Tight Information-theoretic Generalization Bounds via Binary Jensen-Shannon Divergence (ICML 2025 · similarity 0.88)