mlsanityData to 14 Oct 2026

Communication-Efficient Asynchronous Stochastic Frank-Wolfe over Nuclear-norm Balls

arXiv 1910.07703 ↗First posted 17 Oct 2019cs.LG cs.DC cs.NAcited by 1

Not on the map. Why?

Abstract (arXiv)

Large-scale machine learning training suffers from two prior challenges, specifically for nuclear-norm constrained problems with distributed systems: the synchronization slowdown due to the straggling workers, and high communication costs. In this work, we propose an asynchronous Stochastic Frank Wolfe (SFW-asyn) method, which, for the first time, solves the two problems simultaneously, while successfully maintaining the same convergence rate as the vanilla SFW. We implement our algorithm in python (with MPI) to run on Amazon EC2, and demonstrate that SFW-asyn yields speed-ups almost linear to the number of machines compared to the vanilla SFW.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 17 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.