Research map / Optimization / Nonconvex and smooth optimization
Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions
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
- On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning (ICLR 2020 · similarity 0.93)
- Data-Dependent Stability of Stochastic Gradient Descent (ICML 2018 · similarity 0.92)
- Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent (ICML 2020 · similarity 0.92)
- Generalization Error Bounds for Optimization Algorithms via Stability (AAAI 2017 · similarity 0.92)
- Algorithmic Stability Unleashed: Generalization Bounds with Unbounded Losses (ICML 2024 · similarity 0.91)
- Generalization Analysis of Biased Stochastic Gradient Methods for Minimax Problems (NeurIPS 2026 · similarity 0.91)
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.