atlas

Research map / Optimization / Distributed and compressed

Decentralised Learning with Random Features and Distributed Gradient Descent

ICML 2020 · Optimization › Distributed and compressed · approach: Decentralized optimization algorithms · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use approximately √(nm) random featuresDistributed Gradient Descent with Random Features · SUSY, grids and cycles with n=9,25classification error: approximately \sqrt{nm}Helped
Use a larger number of samples per networkDistributed Gradient Descent with Random Features · SUSY, cycle topology with n=49classification error: nm \approx 10^{3}Helped
Use a larger number of samples per networkDistributed Gradient Descent with Random Features · SUSY, cycle topology with n=100classification error: 10^{4}Helped
Use sufficiently many samplesDistributed Gradient Descent with Random Features · SUSY, cycle and grid topologies with n=25,49,100optimal stopping time: 10^{3}Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy