atlas

Research map / Optimization / Distributed and compressed

Towards Stability and Generalization Bounds in Decentralized Minibatch Stochastic Gradient Descent

AAAI 2024 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Derives on-average argument stability and generalization bounds for decentralized minibatch SGD (with and without replacement) across convex, strongly convex, nonconvex and zeroth-order settings.

Problem

Generalization (learning theory) guarantees for decentralized minibatch SGD (DM-SGD) were largely unexplored, while existing D-SGD stability analyses do not cover minibatch sampling.

Approach

Analyzes on-average argument stability of DM-SGD by decomposing the mixing matrix to reduce the update to a centralized minibatch SGD form, and models with-replacement minibatch sampling via binomial sample counts; results recover centralized SGD rates.

Key results

Limitations

Experimental setup

Metrics: on-average argument stability generalization error bound excess generalization error

Baselines: Sun, Li, and Wang 2021 (D-SGD AWC) Bars, Bellet, and Tommasi 2023 (D-SGD CAU) Lei and Ying 2020 (C-SGD) Hardt, Recht, and Singer 2016 (C-SGD) Zhu et al. 2022

Builds on: D-SGD (Lian et al. 2017) on-average argument stability (Lei and Ying 2020) Bars, Bellet, and Tommasi 2023 stability analysis Nikolakakis et al. 2022a ZO stability

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