873 citations · 5.4k across the 120 of their papers we have counts for
10 papers · 1 filter
Run-and-Inspect Method for Nonconvex Optimization and Global Optimality Bounds for R-Local Minimizers
Yifan Chen, Yuejiao Sun, Wotao Yin
Many optimization algorithms converge to stationary points. When the underlying problem is nonconvex, they may get trapped at local minimizers and occasionally stagnate near saddle…
Straggler Mitigation in Distributed Optimization Through Data Encoding
Can Karakus, Yifan Sun, Suhas Diggavi +1
Slow running or straggler tasks can significantly reduce computation speed in distributed computation. Recently, coding-theory-inspired approaches have been applied to mitigate the…
Fast non-coplanar beam orientation optimization based on group sparsity
Daniel O'Connor, Yevgen Voronenko, Dan Nguyen +2
The selection of beam orientations, which is a key step in radiation treatment planning, is particularly challenging for non-coplanar radiotherapy systems due to the large number o…
First and Second Order Methods for Online Convolutional Dictionary Learning
Jialin Liu, Cristina Garcia-Cardona, Brendt Wohlberg +1
Convolutional sparse representations are a form of sparse representation with a structured, translation invariant dictionary. Most convolutional dictionary learning algorithms to d…
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…
Proximal-Proximal-Gradient Method
Ernest K. Ryu, Wotao Yin
In this paper, we present the proximal-proximal-gradient method (PPG), a novel optimization method that is simple to implement and simple to parallelize. PPG generalizes the proxim…