Research map / Optimization / Nonconvex and smooth optimization
Toward Better PAC-Bayes Bounds for Uniformly Stable Algorithms
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
- A PAC-Bayesian Analysis of Randomized Learning with Application to Stochastic Gradient Descent (NeurIPS 2017 · similarity 0.92)
- PAC-Bayes Learning Bounds for Sample-Dependent Priors (NeurIPS 2020 · similarity 0.91)
- Algorithmic Stability Unleashed: Generalization Bounds with Unbounded Losses (ICML 2024 · similarity 0.89)
- Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.88)
- PAC-Bayes-Chernoff bounds for unbounded losses (NeurIPS 2024 · similarity 0.88)
- Uniform Stability and Generalization Error of GD and SGD on Fixed-Point Parameters (NeurIPS 2026 · 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.