Research map / Optimization / Nonconvex and smooth optimization
Sharper Bounds for Uniformly Stable Algorithms with Stationary Mixing Process
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.93)
- Algorithmic Stability Unleashed: Generalization Bounds with Unbounded Losses (ICML 2024 · similarity 0.92)
- Certification-Enhanced Generalization Bounds (NeurIPS 2026 · similarity 0.90)
- Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.89)
- Fantastic Generalization Measures are Nowhere to be Found (ICLR 2024 · similarity 0.89)
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.