Fast Approximate Bayesian Contextual Cold Start Learning (FAB-COST)
Jack R. McKenzie, Peter A. Appleby, Thomas House, Neil Walton

TL;DR
FAB-COST is a novel algorithm that improves cold-start recommendation accuracy by combining Expectation Propagation and Assumed Density Filtering, balancing computational efficiency and precision.
Contribution
It introduces a hybrid variational approach for Bayesian cold-start learning that adapts between EP and ADF to optimize performance and computational cost.
Findings
Over 16% increase in user clicks on real data benchmark.
Effective in cold-start scenarios with limited initial data.
Outperforms traditional Laplace approximation in accuracy.
Abstract
Cold-start is a notoriously difficult problem which can occur in recommendation systems, and arises when there is insufficient information to draw inferences for users or items. To address this challenge, a contextual bandit algorithm -- the Fast Approximate Bayesian Contextual Cold Start Learning algorithm (FAB-COST) -- is proposed, which is designed to provide improved accuracy compared to the traditionally used Laplace approximation in the logistic contextual bandit, while controlling both algorithmic complexity and computational cost. To this end, FAB-COST uses a combination of two moment projection variational methods: Expectation Propagation (EP), which performs well at the cold start, but becomes slow as the amount of data increases; and Assumed Density Filtering (ADF), which has slower growth of computational cost with data size but requires more data to obtain an acceptable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Gaussian Processes and Bayesian Inference · Machine Learning and Algorithms
