Talks and presentations

Optimal anytime regret with two experts

• CMS Winter Meet, Virtual, December 2021
• FOCS 2020, Virtual, November 2020 (20 min. video)
• Toronto Theory Seminar, Toronto, Canada, October 2020

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

• UBC Algorithms Seminar, Vancouver, BC, Canada, November 2019
• EC 2019, Phoenix, Arizona, USA, June 2019 (slides)

Nearly-tight sample complexity bounds for learning mixtures of Gaussians

• CMU AI Seminar, Pittsburgh, Pennsylvania, USA, November 2019
• CAIMS Annual Meeting, Whistler, BC, Canada, June 2019
• SFU Theory seminar, Burnaby, BC, Canada, May 2019
• Bellairs Workshop on Discrete Optimization, Barbados, April 2019
• CMS Winter Meet, Vancouver, BC, Canada, December 2018
• NeurIPS 2018, Montreal, Quebec, Canada, December 2018 (slides)
• UBC Algorithms Seminar, Vancouver, BC, Canada, November 2018
• Google Reading Group, Mountain View, California, USA, August 2018

The value of information concealment

• UBC Algorithms Seminar, Vancouver, BC, Canada, January 2018

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

• COLT 2017, Amsterdam, July 2017

Tight load balancing via randomized local search

• IPDPS 2017, Orlando, USA, May 2017