University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Bayesian sequential design in matrix factorisation models

Bayesian sequential design in matrix factorisation models

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

SNAW05 - Bayesian methods for networks

Co-author: Annie Marsden (University of Cambridge)

Many problems in high-dimensional statistics rely on low-rank decompositions of matrices. Examples include matrix completion, recommender systems or collaborative filtering, and graph clustering or community detection. Most commonly, estimates are obtained by solving an optimisation problem through SDP relaxations, expectation maximisation, or projected gradient descent algorithms. Bayesian analogs of these procedures provide estimates of uncertainty, but these are rarely exploited in practice. In this talk, we explore how the posterior distribution in matrix factorisation models can be put to use in sequential design problems. Bayesian procedures such as Thompson sampling and the Bayesian UCB have been shown to achieve optimal regret in Multi-Arm Bandit problems. We present a simulation study supporting similar strategies in recommender systems.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity