270 citations · 862 across the 16 of their papers we have counts for
4 papers · 1 filter
Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
Zeyuan Allen-Zhu, Zheng Qu, Peter Richtárik +1
Accelerated coordinate descent is widely used in optimization due to its cheap per-iteration cost and scalability to large-scale problems. Up to a primal-dual transformation, it is…
Optimal Auctions vs. Anonymous Pricing
Saeed Alaei, Jason Hartline, Rad Niazadeh +2
For selling a single item to agents with independent but non-identically distributed values, the revenue optimal auction is complex. With respect to it, Hartline and Roughgarden (2…
Improved SVRG for Non-Strongly-Convex or Sum-of-Non-Convex Objectives
Zeyuan Allen-Zhu, Yang Yuan
Many classical algorithms are found until several years later to outlive the confines in which they were conceived, and continue to be relevant in unforeseen settings. In this pape…
Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition
Rong Ge, Furong Huang, Chi Jin +1
We analyze stochastic gradient descent for optimizing non-convex functions. In many cases for non-convex functions the goal is to find a reasonable local minimum, and the main conc…