Research map / Optimization / Distributed and compressed
Decentralized Dictionary Learning Over Time-Varying Digraphs
Amir Daneshmand, Ying Sun, Gesualdo Scutari, Francisco Facchinei, Brian M. Sadler
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 changed | Where | Measured | Effect |
|---|---|---|---|
| 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.862 | Improved |
| use Linearized D4L instead of Prox-PDA-IP | distributed dictionary learning · Image denoising (150 nodes) | average time per iteration (sec): 30.98 -> 2.862 | Improved |
| use Linearized D4L instead of ATC | distributed dictionary learning · Image denoising (150 nodes) | average time per iteration (sec): 9.838 -> 2.862 | Improved |
| use D4L (gradient tracking, push-sum) instead of ATC for dictionary consensus | distributed dictionary learning · Image denoising (150 nodes, undirected graph) | consensus disagreement | Improved |
| use D4L instead of Prox-PDA-IP and ATC at a fixed budget of message exchanges | distributed dictionary learning · Image denoising (150 nodes, undirected graph) | objective value vs message exchanges | Improved |
Closest papers by meaning
- Cross-Gradient Aggregation for Decentralized Learning from Non-IID Data (ICML 2021 · similarity 0.85)
- BEER: Fast $O(1/T)$ Rate for Decentralized Nonconvex Optimization with Communication Compression (NeurIPS 2022 · similarity 0.85)
- Quantized Decentralized Stochastic Learning over Directed Graphs (ICML 2020 · similarity 0.85)
- Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks (NeurIPS 2024 · similarity 0.84)
- An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization (ICML 2024 · similarity 0.83)
- Scalable Decentralized Algorithms for Online Personalized Mean Estimation (AAAI 2025 · similarity 0.83)
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.
