Research map / Optimization / Nonconvex and smooth optimization
Toward Better Generalization Bounds of Stochastic Optimization for Nonconvex Learning
Yunwen Lei
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
- High Probability Guarantees for Nonconvex Stochastic Gradient Descent with Heavy Tails (ICML 2022 · similarity 0.93)
- Learning Rates for Stochastic Gradient Descent With Nonconvex Objectives (TPAMI 2021 · similarity 0.92)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.91)
- Stochastic Optimization Schemes for Performative Prediction with Nonconvex Loss (NeurIPS 2024 · similarity 0.89)
- Towards Stability and Generalization Bounds in Decentralized Minibatch Stochastic Gradient Descent (AAAI 2024 · similarity 0.89)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 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.
