518 citations · 948 across the 34 of their papers we have counts for
Showing 2012 · cs.LGShow all
3 papers · 2 filters
cs.LG2012★ 1 cited
Efficient learning of simplices
Joseph Anderson, Navin Goyal, Luis Rademacher
We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and th…
cs.LG2012★ 303 cited
Further Optimal Regret Bounds for Thompson Sampling
Shipra Agrawal, Navin Goyal
Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant inte…
cs.LG2012★ 518 cited
Thompson Sampling for Contextual Bandits with Linear Payoffs
Shipra Agrawal, Navin Goyal
Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant inte…