4 citations · 33 across the 44 of their papers we have counts for
6 papers · 1 filter
Quota Marketplace: Dynamic Pricing for Efficient Allocation of ML Training Resources
Balasubramanian Sivan, Renato Paes Leme, Mihai Tiuca +6
The escalating demand for Machine Learning (ML) training resources in recent years has resulted in a substantial gap between the high demand and the available supply. Efficient all…
Robust Budget Pacing with a Single Sample
Santiago Balseiro, Rachitesh Kumar, Vahab Mirrokni +2
Major Internet advertising platforms offer budget pacing tools as a standard service for advertisers to manage their ad campaigns. Given the inherent non-stationarity in an adverti…
Pseudonorm Approachability and Applications to Regret Minimization
Christoph Dann, Yishay Mansour, Mehryar Mohri +2
Blackwell's celebrated approachability theory provides a general framework for a variety of learning problems, including regret minimization. However, Blackwell's proof and implici…
Strategizing against Learners in Bayesian Games
Yishay Mansour, Mehryar Mohri, Jon Schneider +1
We study repeated two-player games where one of the players, the learner, employs a no-regret learning strategy, while the other, the optimizer, is a rational utility maximizer. We…
Tight Lower Bounds for Multiplicative Weights Algorithmic Families
Nick Gravin, Yuval Peres, Balasubramanian Sivan
We study the fundamental problem of prediction with expert advice and develop regret lower bounds for a large family of algorithms for this problem. We develop simple adversarial p…
Towards Optimal Algorithms for Prediction with Expert Advice
Nick Gravin, Yuval Peres, Balasubramanian Sivan
We study the classical problem of prediction with expert advice in the adversarial setting with a geometric stopping time. In 1965, Cover gave the optimal algorithm for the case of…