activity
20112026
most citedTight Regret Bounds for Stochastic Combinatorial Semi-Bandits

140 citations · 1.3k across the 125 of their papers we have counts for

collaborators
Showing 2012Show all

5 papers · 1 filter

cs.LG2012★ 67 cited

Leveraging Side Observations in Stochastic Bandits

Stephane Caron, Branislav Kveton, Marc Lelarge +1

This paper considers stochastic bandits with side observations, a model that accounts for both the exploration/exploitation dilemma and relationships between arms. In this setting,…

cs.AI2012

Solving Factored MDPs with Continuous and Discrete Variables

Carlos E. Guestrin, Milos Hauskrecht, Branislav Kveton

Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods c…

cs.AI2012★ 3 cited

Partitioned Linear Programming Approximations for MDPs

Branislav Kveton, Milos Hauskrecht

Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal…

cs.LG2012★ 2 cited

Automatic Tuning of Interactive Perception Applications

Qian Zhu, Branislav Kveton, Lily Mummert +1

Interactive applications incorporating high-data rate sensing and computer vision are becoming possible due to novel runtime systems and the use of parallel computation resources.…

cs.LG2012★ 18 cited

Online Semi-Supervised Learning on Quantized Graphs

Michal Valko, Branislav Kveton, Ling Huang +1

In this paper, we tackle the problem of online semi-supervised learning (SSL). When data arrive in a stream, the dual problems of computation and data storage arise for any SSL met…