research
∙
07/09/2022
Auction for Double-Wide Ads
We propose an auction for online advertising where each ad occupies eith...
share
research
∙
05/29/2019
Learning to Crawl
Web crawling is the problem of keeping a cache of webpages fresh, i.e., ...
research
∙
02/06/2019
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
We study the problem of efficient online multiclass linear classificatio...
research
∙
01/16/2019
The information-theoretic value of unlabeled data in semi-supervised learning
We quantify the separation between the numbers of labeled examples requi...
research
∙
11/06/2015
Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice
We prove non-asymptotic lower bounds on the expectation of the maximum o...
research
∙
02/14/2011
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many ...
research
∙
02/10/2011
Toward a Classification of Finite Partial-Monitoring Games
Partial-monitoring games constitute a mathematical framework for sequent...
research
∙
03/09/2010