|
Poster
|
Mon 9:00
|
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
Nicolas Boumal · Vlad Voroninski · Afonso Bandeira
|
|
|
Poster
|
Wed 9:00
|
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent
Chi Jin · Sham Kakade · Praneeth Netrapalli
|
|
|
Poster
|
Wed 9:00
|
A Multi-step Inertial Forward-Backward Splitting Method for Non-convex Optimization
Jingwei Liang · Jalal Fadili · Gabriel Peyré
|
|
|
Poster
|
Wed 9:00
|
Adaptive Averaging in Accelerated Descent Dynamics
Walid Krichene · Alexandre Bayen · Peter Bartlett
|
|
|
Poster
|
Wed 9:00
|
Optimal Black-Box Reductions Between Optimization Objectives
Zeyuan Allen-Zhu · Elad Hazan
|
|
|
Poster
|
Mon 9:00
|
Stochastic Three-Composite Convex Minimization
Alp Yurtsever · Bang Cong Vu · Volkan Cevher
|
|
|
Poster
|
Mon 9:00
|
A Simple Practical Accelerated Method for Finite Sums
Aaron Defazio
|
|
|
Poster
|
Wed 9:00
|
Tight Complexity Bounds for Optimizing Composite Objectives
Blake Woodworth · Nati Srebro
|
|
|
Oral
|
Tue 2:00
|
Hierarchical Clustering via Spreading Metrics
Aurko Roy · Sebastian Pokutta
|
|
|
Poster
|
Tue 9:00
|
Hierarchical Clustering via Spreading Metrics
Aurko Roy · Sebastian Pokutta
|
|
|
Poster
|
Mon 9:00
|
Algorithms and matching lower bounds for approximately-convex optimization
Andrej Risteski · Yuanzhi Li
|
|
|
Poster
|
Tue 9:00
|
Computational and Statistical Tradeoffs in Learning to Rank
Ashish Khetan · Sewoong Oh
|
|
