Methods › General › Distributed Methods › SlowMo
SlowMo
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Slow Momentum (SlowMo) is a distributed optimization method where workers periodically synchronize and perform a momentum update, after multiple iterations of a base optimization algorithm. Periodically, after taking some number τ of base algorithm steps, workers average their parameters using ALLREDUCE and perform a momentum update.
Papers archive 2025-07-28
1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentum 1 Oct 2019 · 2 repositories · arXiv:1910.00643Syntology ran 0 of 3 samples · 3 unverified
Tasks archive 2025-07-28
6 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Blocking | 1 |
| Distributed Optimization | 1 |
| Image Classification | 1 |
| Machine Translation | 1 |
| Translation | 1 |
| image-classification | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections