21 citations · 33 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 10 cited
Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent
Nicholas J. A. Harvey, Christopher Liaw, Sikander Randhawa
We consider stochastic gradient descent algorithms for minimizing a non-smooth, strongly-convex function. Several forms of this algorithm, including suffix averaging, are known to…
cs.GT2019★ 2 cited
The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue
Hu Fu, Christopher Liaw, Sikander Randhawa
Bulow and Klemperer's well-known result states that, in a single-item auction where the bidders' values are independently and identically drawn from a regular distribution, the…