Explore-exploit in top-N recommender systems via Gaussian processes

By Hastagiri P. Vanchinathan, Isidor Nikolic, Fabio De Bona, Andreas Krause. 2014

97 citations recorded by the source corpus.

We address the challenge of ranking recommendation lists based on click feedback by efficiently encoding similarities among users and among items. The key challenges are threefold: (1) combinatorial number of lists; (2) sparse feedback and (3) context dependent recommendations. We propose the CGPRank algorithm, which exploits prior information specified in terms of a Gaussian process kernel function, which allows to share feedback in three ways: Between positions in a list, between items, and between contexts. Under our model, we provide strong performance guarantees and empirically evaluate our algorithm on data from two large scale recommendation tasks: Yahoo! news article recommendation, and Google books. In our experiments, CGPRank significantly outperforms state-of-the-art multi-armed bandit and learning-to-rank methods, with an 18% increase in clicks.

Subfields: Artificial Intelligence, Information Systems, Management Science and Operations Research

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Frank Hutter
  2. José Miguel Hernández-Lobato
  3. Sergey Levine
  4. Nando de Freitas
  5. Ziyun Wang
  6. Kevin Swersky
  7. Chelsea Finn
  8. Aaron Klein

In Information Systems

  1. Katja Hofmann
  2. Barbara E. Engelhardt
  3. Brandon M Stewart
  4. Filip Radlinski
  5. Ryan-Rhys Griffiths
  6. José Miguel Hernández-Lobato
  7. Ryan P. Adams
  8. Nando de Freitas

In Management Science and Operations Research

  1. José Miguel Hernández-Lobato
  2. Frank Hutter
  3. Ziyun Wang
  4. Bobak Shahriari
  5. Kevin Swersky
  6. Ryan P. Adams
  7. Ryan-Rhys Griffiths
  8. Nando de Freitas

Citations in the corpus