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 show that asymptotically, completely asynchronous stochastic gradient procedures achieve optimal (even to constant factors) convergence rates for the solution of convex optimization problems under nearly the same conditions required for asymptotic optimality of standard stochastic gradient procedures. Roughly, the noise inherent to the stochastic approximation scheme dominates any noise from asynchrony. We also give empirical evidence demonstrating the strong performance of asynchronous, parallel stochastic optimization schemes, demonstrating that the robustness inherent to stochastic approximation problems allows substantially faster parallel and asynchronous solution methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1508.00882")
get_code_for_paper("1508.00882")
have("1508.00882")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1508.00882.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1508.00882)
Connect an agent — have() is free.