No confident code implementation found for this paper. 1 possible match can be shown below.
We develop a novel latent-bandit algorithm for tackling the cold-start problem for new users joining a recommender system. This new algorithm significantly outperforms the state of the art, simultaneously achieving both higher accuracy and lower regret.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Cold & Warm Net: Addressing Cold-Start Users in Recommender Systems
Recommendation Is a Dish Better Served Warm
Maximum Impact with Fewer Features: Efficient Feature Selection for Cold-Start Recommenders through Collaborative Importance Weighting
Contrastive Learning for Cold Start Recommendation with Adaptive Feature Fusion
Breaking the Cold-Start Barrier: Reinforcement Learning with Double and Dueling DQNs
Efficient Cold-Start Recommendation via BPE Token-Level Embedding Initialization with LLM
@article{young2023high,
title = {High Accuracy and Low Regret for User-Cold-Start Using Latent Bandits},
author = {David Young and Douglas Leith},
year = {2023},
eprint = {2305.18305},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2305.18305v1}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2305.18305)