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.
When scaling distributed training, the communication overhead is often the bottleneck. In this paper, we propose a novel SGD variant with reduced communication and adaptive learning rates. We prove the convergence of the proposed algorithm for smooth but non-convex problems. Empirical results show that the proposed algorithm significantly reduces the communication overhead, which, in turn, reduces the training time by up to 30% for the 1B word dataset.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1911.09030")
get_code_for_paper("1911.09030")
have("1911.09030")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1911.09030.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1911.09030)
Connect an agent — have() is free.