Dynamic collaborative filtering Thompson Sampling for cross-domain advertisements recommendation

2022-08-25 · Shion Ishikawa, Young-joo Chung, Yu Hirate

Recently online advertisers utilize Recommender systems (RSs) for display advertising to improve users' engagement. The contextual bandit model is a widely used RS to exploit and explore users' engagement and maximize the long-term rewards such as clicks or conversions. However, the current models aim to optimize a set of ads only in a specific domain and do not share information with other models in multiple domains. In this paper, we propose dynamic collaborative filtering Thompson Sampling (DCTS), the novel yet simple model to transfer knowledge among multiple bandit models. DCTS exploits similarities between users and between ads to estimate a prior distribution of Thompson sampling. Such similarities are obtained based on contextual features of users and ads. Similarities enable models in a domain that didn't have much data to converge more quickly by transferring knowledge. Moreover, DCTS incorporates temporal dynamics of users to track the user's recent change of preference. We first show transferring knowledge and incorporating temporal dynamics improve the performance of the baseline models on a synthetic dataset. Then we conduct an empirical analysis on a real-world dataset and the result showed that DCTS improves click-through rate by 9.7% than the state-of-the-art models. We also analyze hyper-parameters that adjust temporal dynamics and similarities and show the best parameter which maximizes CTR.

📄 PDF Abstract BibTeX arXiv:2208.11926

Code (0)

등록된 구현이 없습니다.

Tasks

Collaborative Filtering Recommendation SystemsThompson Sampling

Efficient Thompson Sampling for Online Matrix-Factorization Recommendation

2015-12-01 · NeurIPS 2015 12 · Jaya Kawale, Hung H. Bui, Branislav Kveton, Long Tran-Thanh 외

Matrix factorization (MF) collaborative filtering is an effective and widely used method in recommendation systems. However, the problem of finding an optimal trade-off between exploration and exploitation (otherwise kno…

Collaborative Filtering Recommendation Systems Thompson Sampling

Distributed Thompson Sampling

2020-12-03 · Jing Dong, Tan Li, Shaolei Ren, Linqi Song

We study a cooperative multi-agent multi-armed bandits with M agents and K arms. The goal of the agents is to minimized the cumulative regret. We adapt a traditional Thompson Sampling algoirthm under the distributed sett…

Multi-Armed Bandits Thompson Sampling

FedRTS: Federated Robust Pruning via Combinatorial Thompson Sampling

2025-01-31 · Hong Huang, Hai Yang, Yuan Chen, Jiaxun Ye 외

Federated Learning (FL) enables collaborative model training across distributed clients without data sharing, but its high computational and communication demands strain resource-constrained devices. While existing metho…

Federated Learning Thompson Sampling

When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution

2021-04-14 · Chuanhao Li, Qingyun Wu, Hongning Wang

Collaborative bandit learning, i.e., bandit algorithms that utilize collaborative filtering techniques to improve sample efficiency in online interactive recommendation, has attracted much research attention as it enjoys…

Bayesian Inference Collaborative Filtering Interactive Recommendation Model Selection+2

Sequential Matrix Completion

2017-10-23 · Annie Marsden, Sergio Bacallado

We propose a novel algorithm for sequential matrix completion in a recommender system setting, where the $(i,j)$th entry of the matrix corresponds to a user $i$'s rating of product $j$. The objective of the algorithm is …

Collaborative Filtering Matrix Completion Recommendation Systems Thompson Sampling