SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1312.7853 · 2013

Communication Efficient Distributed Optimization using an Approximate Newton-type Method

arXiv · PDF · Open in the Atlas

Code that ran

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.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We present a novel Newton-type method for distributed optimization, which is particularly well suited for stochastic optimization and learning problems. For quadratic objectives, the method enjoys a linear rate of convergence which provably \emph{improves} with the data size, requiring an essentially constant number of iterations under reasonable assumptions. We provide theoretical and empirical evidence of the advantages of our method compared to other approaches, such as one-shot parameter averaging and ADMM.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1312.7853")
get_code_for_paper("1312.7853")
have("1312.7853")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1312.7853.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1312.7853.svg)](https://syntology.ai/paper/1312.7853)

Connect an agent — have() is free.