atlas

Research map / Optimization / Nonconvex and smooth optimization

Efficient Decentralized Stochastic Gradient Descent Method for Nonconvex Finite-Sum Optimization Problems

AAAI 2022 · Optimization › Nonconvex and smooth optimization · approach: Proximal finite-sum methods · 2 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use EDSGD instead of DGET, avoiding periodic full-gradient computationDecentralized finite-sum optimization · Nonconvex finite-sum optimizationsample complexity: O(Kn + Kn1/2/((1−λ)pϵ2)) -> O(K1/2n1/2/((1 − λ)ϵ2))Helped
Use EDSGD instead of DGETDecentralized finite-sum optimization · Nonconvex finite-sum optimizationcommunication complexity: O(1/((1−λ)pϵ2)) -> O(1/((1 − λ)ϵ2))Helped
Use EDSGD instead of GT-SARAHDecentralized finite-sum optimization · Nonconvex finite-sum optimizationcommunication complexity: O(1/((1−λ)3ϵ2)) -> O(1/((1 − λ)ϵ2))Helped
Avoid periodic full-gradient computationEDSGD · Logistic regression on six datasetsobjective value versus gradient evaluationsHelped
Use EDSGD instead of the compared baselinesDecentralized logistic regression · Six classification datasetsgradient norm versus gradient evaluationsHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy