Scalable Bayesian Preference Learning for Crowds

by   Edwin Simpson, et al.

We propose a scalable Bayesian preference learning method for jointly predicting the preferences of individuals as well as the consensus of a crowd from pairwise labels. Peoples' opinions often differ greatly, making it difficult to predict their preferences from small amounts of personal data. Individual biases also make it harder to infer the consensus of a crowd when there are few labels per item. We address these challenges by combining matrix factorisation with Gaussian processes, using a Bayesian approach to account for uncertainty arising from noisy and sparse data. Our method exploits input features, such as text embeddings and user metadata, to predict preferences for new items and users that are not in the training set. As previous solutions based on Gaussian processes do not scale to large numbers of users, items or pairwise labels, we propose a stochastic variational inference approach that limits computational and memory costs. Our experiments on a recommendation task show that our method is competitive with previous approaches despite our scalable inference approximation. We demonstrate the method's scalability on a natural language processing task with thousands of users and items, and show improvements over the state of the art on this task. We make our software publicly available for future work.


page 1

page 2

page 3

page 4


Finding Convincing Arguments Using Scalable Bayesian Preference Learning

We introduce a scalable Bayesian preference learning method for identify...

Large Language Models are Competitive Near Cold-start Recommenders for Language- and Item-based Preferences

Traditional recommender systems leverage users' item preference history ...

Multi-output Gaussian Processes for Uncertainty-aware Recommender Systems

Recommender systems are often designed based on a collaborative filterin...

A Recommender System Based on a Double Feature Allocation Model

A collaborative filtering recommender system predicts user preferences b...

Learning Inconsistent Preferences with Kernel Methods

We propose a probabilistic kernel approach for preferential learning fro...

Gradient-based Optimization for Bayesian Preference Elicitation

Effective techniques for eliciting user preferences have taken on added ...

Scalable Generalized Dynamic Topic Models

Dynamic topic models (DTMs) model the evolution of prevalent themes in l...

Please sign up or login with your details

Forgot password? Click here to reset