Research map / Optimization / Distributed and compressed
Distributed Stochastic Gradient Descent: Nonconvexity, Nonsmoothness, and Convergence to Local Minima
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
- Communication-Efficient Stochastic Gradient Descent, with Applications to Neural Networks (NeurIPS 2017 · similarity 0.89)
- Accelerated Dual Method for Distributed Optimization: An Inexact-Gradient View of Local Updates (ICML 2026 · similarity 0.88)
- Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization (ICML 2019 · similarity 0.88)
- Towards Stability and Generalization Bounds in Decentralized Minibatch Stochastic Gradient Descent (AAAI 2024 · similarity 0.87)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.86)
- SLowcalSGD : Slow Query Points Improve Local-SGD for Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.86)
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.