140 citations · 438 across the 8 of their papers we have counts for
8 papers
Does Weather Matter? Causal Analysis of TV Logs
Shi Zong, Branislav Kveton, Shlomo Berkovsky +3
Weather affects our mood and behaviors, and many aspects of our life. When it is sunny, most people become happier; but when it rains, some people get depressed. Despite this evide…
Combinatorial Cascading Bandits
Branislav Kveton, Zheng Wen, Azin Ashkan +1
We propose combinatorial cascading bandits, a class of partial monitoring problems where at each step a learning agent chooses a tuple of ground items subject to constraints and re…
Cascading Bandits: Learning to Rank in the Cascade Model
Branislav Kveton, Csaba Szepesvari, Zheng Wen +1
A search engine usually outputs a list of web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user…
DUM: Diversity-Weighted Utility Maximization for Recommendations
Azin Ashkan, Branislav Kveton, Shlomo Berkovsky +1
The need for diversification of recommendation lists manifests in a number of recommender systems use cases. However, an increase in diversity may undermine the utility of the reco…
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits
Branislav Kveton, Zheng Wen, Azin Ashkan +1
A stochastic combinatorial semi-bandit is an online learning problem where at each step a learning agent chooses a subset of ground items subject to constraints, and then observes…
Efficient Learning in Large-Scale Combinatorial Semi-Bandits
Zheng Wen, Branislav Kveton, Azin Ashkan
A stochastic combinatorial semi-bandit is an online learning problem where at each step a learning agent chooses a subset of ground items subject to combinatorial constraints, and…
Learning to Act Greedily: Polymatroid Semi-Bandits
Branislav Kveton, Zheng Wen, Azin Ashkan +1
Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can be solved optimally by a greedy method. In this work, we study a learning variant…
Matroid Bandits: Fast Combinatorial Optimization with Learning
Branislav Kveton, Zheng Wen, Azin Ashkan +2
A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a cons…