atlas

Research map / Optimization / Distributed and compressed

Communication-Efficient Frank-Wolfe Algorithm for Nonconvex Decentralized Distributed Learning

AAAI 2021 · Optimization › Distributed and compressed · approach: Communication complexity theory · 12 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 DQSFW instead of DeFW or QFWDecentralized low-rank matrix completion · MovieLens 100k and MovieLens 1mtraining loss versus bits transferredHelped
Increase the number of workersDQSFW · MovieLens 100k and MovieLens 1mcompetitiveness against baselinesHelped
Use DQSFW instead of DeFW or QFWVGG11 compression on CIFAR 10 · CIFAR 10training loss versus bits transferredHelped
Use DQSFW instead of QFWVGG11 compression on CIFAR 10 · CIFAR 10training loss versus timeNo clear effect
Use gradient tracking to reach consensus on gradientsDecentralized quantized Frank-Wolfe · Nonconvex constrained optimizationconvergence to a stationary pointHelped
Use vanilla decentralized quantized stochastic Frank-Wolfe without gradient trackingDecentralized quantized Frank-Wolfe · Nonconvex constrained optimizationconvergenceHurt

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