42 citations · 89 across the 6 of their papers we have counts for
6 papers · 1 filter
Scaled Relative Graph: Nonexpansive operators via 2D Euclidean Geometry
Ernest K. Ryu, Robert Hannah, Wotao Yin
Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper,…
Breaking the Span Assumption Yields Fast Finite-Sum Minimization
Robert Hannah, Yanli Liu, Daniel O'Connor +1
In this paper, we show that SVRG and SARAH can be modified to be fundamentally faster than all of the other standard algorithms that minimize the sum of smooth functions, such…
A2BCD: An Asynchronous Accelerated Block Coordinate Descent Algorithm With Optimal Complexity
Robert Hannah, Fei Feng, Wotao Yin
In this paper, we propose the Asynchronous Accelerated Nonuniform Randomized Block Coordinate Descent algorithm (A2BCD), the first asynchronous Nesterov-accelerated algorithm that…
More Iterations per Second, Same Quality -- Why Asynchronous Algorithms may Drastically Outperform Traditional Ones
Robert Hannah, Wotao Yin
In this paper, we consider the convergence of a very general asynchronous-parallel algorithm called ARock, that takes many well-known asynchronous algorithms as special cases (grad…
Asynchronous Coordinate Descent under More Realistic Assumptions
Tao Sun, Robert Hannah, Wotao Yin
Asynchronous-parallel algorithms have the potential to vastly speed up algorithms by eliminating costly synchronization. However, our understanding to these algorithms is limited b…
On Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms
Robert Hannah, Wotao Yin
The need for scalable numerical solutions has motivated the development of asynchronous parallel algorithms, where a set of nodes run in parallel with little or no synchronization,…