Spectral Bandits for Smooth Graph Functions with Applications in Recommender Systems

Tomáš Kocák 1 Michal Valko 1 Rémi Munos 2, 1 Branislav Kveton 3 Shipra Agrawal 4
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
2 Microsoft - Microsoft Research [Cambridge]
3 Technicolor Research [Palo Alto]
4 Microsoft Research [Redmond]
Abstract : Smooth functions on graphs have wide applications in manifold and semi-supervised learning. In this paper, we study a bandit problem where the payoffs of arms are smooth on a graph. This framework is suitable for solving online learning problems that involve graphs, such as content-based recommendation. In this problem, each recommended item is a node and its expected rating is similar to its neighbors. The goal is to recommend items that have high expected ratings. We aim for the algorithms where the cumulative regret would not scale poorly with the number of nodes. In particular, we introduce the notion of an effective dimension, which is small in real-world graphs, and propose two algorithms for solving our problem that scale linearly in this dimension. Our experiments on real-world content recommendation problem show that a good estimator of user preferences for thousands of items can be learned from just tens nodes evaluations.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
https://hal.inria.fr/hal-01045036
Contributor : Michal Valko <>
Submitted on : Thursday, July 24, 2014 - 2:58:25 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Tuesday, November 25, 2014 - 4:46:25 PM

File

Spectral_Bandits.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01045036, version 1

Collections

INRIA | UNIV-LILLE3 | LAGIS | CRISTAL | CRISTAL-SEQUEL

Citation

Tomáš Kocák, Michal Valko, Rémi Munos, Branislav Kveton, Shipra Agrawal. Spectral Bandits for Smooth Graph Functions with Applications in Recommender Systems. AAAI Workshop on Sequential Decision-Making with Big Data, Jul 2014, Québec City, Canada. ⟨hal-01045036⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

549

Files downloads

231

Contact


archive-ouverte@inria.fr