AI Paper Atlas

Research map / Optimization / Distributed and compressed

DICOD: Distributed Convolutional Coordinate Descent for Convolutional Sparse Coding

ICML 2018 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 7 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
Locally greedy updates (LGCD) instead of full greedy selectionsequential coordinate descent · Synthetic long signaliterations and runtime to convergenceHelped
Distributing greedy CD across cores with local communication (DICOD)greedy coordinate descent for convolutional sparse coding · Synthetic long signalruntimeHelped
Increasing number of cores beyond the sweet spot (M*alpha approaching 1/2)DICOD · Speedup evaluation T=150W and T=750WspeedupHurt
Randomized coordinate descent instead of greedy selectioncoordinate descent · Synthetic long signaliterations to convergenceHurt
Using a larger number of segments M (interference-prone) in LGCD vs DICOD30 with more coresDICOD · Synthetic long signal, iterationsiterations to reach accuracyHurt

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