Talks and presentations

Optimal anytime regret with two experts

The Vickrey auction with a single duplicate bidder approximates the optimal revenue

Nearly-tight sample complexity bounds for learning mixtures of Gaussians

The value of information concealment

Nearly-tight VC-dimension bounds for piecewise linear neural networks

Tight load balancing via randomized local search