Timezone: »
Diversified retrieval and online learning are two core research areas in the design of modern information retrieval systems.In this paper, we propose the linear submodular bandits problem, which is an online learning setting for optimizing a general class of feature-rich submodular utility models for diversified retrieval. We present an algorithm, called LSBGREEDY, and prove that it efficiently converges to a near-optimal model. As a case study, we applied our approach to the setting of personalized news recommendation, where the system must recommend small sets of news articles selected from tens of thousands of available articles each day. In a live user study, we found that LSBGREEDY significantly outperforms existing online learning approaches.
Author Information
Yisong Yue (California Institute of Technology)
Carlos Guestrin (Apple & University of Washington)
More from the Same Authors
-
2018 Poster: Learning to Optimize Tensor Programs »
Tianqi Chen · Lianmin Zheng · Eddie Yan · Ziheng Jiang · Thierry Moreau · Luis Ceze · Carlos Guestrin · Arvind Krishnamurthy -
2018 Spotlight: Learning to Optimize Tensor Programs »
Tianqi Chen · Lianmin Zheng · Eddie Yan · Ziheng Jiang · Thierry Moreau · Luis Ceze · Carlos Guestrin · Arvind Krishnamurthy -
2018 Poster: Training Deep Models Faster with Robust, Approximate Importance Sampling »
Tyler Johnson · Carlos Guestrin -
2016 : Invited talk, Carlos Guestrin »
Carlos Guestrin -
2016 Poster: Unified Methods for Exploiting Piecewise Linear Structure in Convex Optimization »
Tyler Johnson · Carlos Guestrin -
2014 Workshop: Personalization: Methods and Applications »
Yisong Yue · Khalid El-Arini · Dilan Gorur -
2014 Poster: Divide-and-Conquer Learning by Anchoring a Conical Hull »
Tianyi Zhou · Jeffrey A Bilmes · Carlos Guestrin -
2012 Demonstration: GraphLab: A Framework For Machine Learning in the Cloud »
Yucheng Low · Haijie Gu · Carlos Guestrin -
2011 Workshop: Big Learning: Algorithms, Systems, and Tools for Learning at Scale »
Joseph E Gonzalez · Sameer Singh · Graham Taylor · James Bergstra · Alice Zheng · Misha Bilenko · Yucheng Low · Yoshua Bengio · Michael Franklin · Carlos Guestrin · Andrew McCallum · Alexander Smola · Michael Jordan · Sugato Basu -
2010 Poster: Evidence-Specific Structures for Rich Tractable CRFs »
Anton Chechetka · Carlos Guestrin -
2010 Poster: Inference with Multivariate Heavy-Tails in Linear Models »
Danny Bickson · Carlos Guestrin -
2009 Workshop: Learning with Orderings »
Tiberio Caetano · Carlos Guestrin · Jonathan Huang · Risi Kondor · Guy Lebanon · Marina Meila -
2009 Workshop: Large-Scale Machine Learning: Parallelism and Massive Datasets »
Alexander Gray · Arthur Gretton · Alexander Smola · Joseph E Gonzalez · Carlos Guestrin -
2009 Poster: Riffled Independence for Ranked Data »
Jonathan Huang · Carlos Guestrin -
2009 Spotlight: Riffled Independence for Ranked Data »
Jonathan Huang · Carlos Guestrin -
2007 Oral: Efficient Inference forDistributions on Permutations »
Jonathan Huang · Carlos Guestrin · Leonidas Guibas -
2007 Poster: Efficient Inference forDistributions on Permutations »
Jonathan Huang · Carlos Guestrin · Leonidas Guibas -
2007 Spotlight: Selecting Observations against Adversarial Objectives »
Andreas Krause · H. Brendan McMahan · Carlos Guestrin · Anupam Gupta -
2007 Poster: Selecting Observations against Adversarial Objectives »
Andreas Krause · H. Brendan McMahan · Carlos Guestrin · Anupam Gupta -
2007 Poster: Efficient Principled Learning of Thin Junction Trees »
Anton Chechetka · Carlos Guestrin -
2006 Poster: Distributed Inference in Dynamical Systems »
Stanislav Funiak · Carlos Guestrin · Mark A Paskin · Rahul Sukthankar