253 citations
- Technicolor (Germany)DE18 papers
- Technicolor (France)FR11 papers
- Stanford UniversityUS7 papers
- Adobe Systems (United States)US6 papers
- Massachusetts Institute of TechnologyUS5 papers
- Rutgers, The State University of New JerseyUS4 papers
- University of MichiganUS4 papers
- Max Planck Institute for InformaticsDE3 papers
- University of AlbertaCA3 papers
- University of Wisconsin–MadisonUS3 papers
- Yahoo (United States)US3 papers
- Centre Inria de l'Université de LilleFR2 papers
4 papers · 2 filters
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…
Guess Who Rated This Movie: Identifying Users Through Subspace Clustering
Amy Zhang, Nadia Fawaz, Stratis Ioannidis +1
It is often the case that, within an online recommender system, multiple users share a common account. Can such shared accounts be identified solely on the basis of the userprovide…
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…
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…