research
∙
02/20/2020
Optimal anytime regret with two experts
The multiplicative weights method is an algorithm for the problem of pre...
share
research
∙
09/02/2019
Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent
We consider stochastic gradient descent algorithms for minimizing a non-...
research
∙
05/09/2019
The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue
Bulow and Klemperer's well-known result states that, in a single-item au...
research
∙
12/13/2018