We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We describe ASAGA, an asynchronous parallel version of the incremental gradient algorithm SAGA that enjoys fast linear convergence rates. Through a novel perspective, we revisit and clarify a subtle but important technical issue present in a large fraction of the recent convergence rate proofs for asynchronous parallel optimization algorithms, and propose a simplification of the recently introduced "perturbed iterate" framework that resolves it. We thereby prove that ASAGA can obtain a theoretical linear speedup on multi-core systems even without sparsity assumptions. We present results of an implementation on a 40-core architecture illustrating the practical speedup as well as the hardware overhead.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1606.04809")
get_code_for_paper("1606.04809")
have("1606.04809")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1606.04809.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1606.04809)
Connect an agent — have() is free.