AI Paper Atlas

Research map / Optimization / Distributed and compressed

Decentralized Dictionary Learning Over Time-Varying Digraphs

Amir Daneshmand, Ying Sun, Gesualdo Scutari, Francisco Facchinei, Brian M. Sadler

JMLR 2019 · Optimization › Distributed and compressed · approach: Compressed distributed optimization · 8 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 linearized surrogate for the dictionary-learning subproblem instead of the plain (original function) surrogate in D4L (ablation)D4L · Image denoising (150 nodes)average time per iteration (sec): 11.328 -> 2.862Improved
use Linearized D4L instead of Prox-PDA-IPdistributed dictionary learning · Image denoising (150 nodes)average time per iteration (sec): 30.98 -> 2.862Improved
use Linearized D4L instead of ATCdistributed dictionary learning · Image denoising (150 nodes)average time per iteration (sec): 9.838 -> 2.862Improved
use D4L (gradient tracking, push-sum) instead of ATC for dictionary consensusdistributed dictionary learning · Image denoising (150 nodes, undirected graph)consensus disagreementImproved
use D4L instead of Prox-PDA-IP and ATC at a fixed budget of message exchangesdistributed dictionary learning · Image denoising (150 nodes, undirected graph)objective value vs message exchangesImproved

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