DeepAI AI Chat
Log In Sign Up

Greedy Optimized Multileaving for Personalization

by   Kojiro Iizuka, et al.
Gunosy Inc.

Personalization plays an important role in many services. To evaluate personalized rankings, online evaluation, such as A/B testing, is widely used today. Recently, multileaving has been found to be an efficient method for evaluating rankings in information retrieval fields. This paper describes the first attempt to optimize the multileaving method for personalization settings. We clarify the challenges of applying this method to personalized rankings. Then, to solve these challenges, we propose greedy optimized multileaving (GOM) with a new credit feedback function. The empirical results showed that GOM was stable for increasing ranking lengths and the number of rankers. We implemented GOM on our actual news recommender systems, and compared its online performance. The results showed that GOM evaluated the personalized rankings precisely, with significantly smaller sample sizes (< 1/10) than A/B testing.


page 1

page 2

page 3

page 4


Personalization in E-Grocery: Top-N versus Top-k Rankings

Business success in e-commerce depends on customer perceived value. A cu...

Optimizing Rankings for Recommendation in Matching Markets

Based on the success of recommender systems in e-commerce, there is grow...

Fairness of Exposure in Rankings

Rankings are ubiquitous in the online world today. As we have transition...

Faithfully Explaining Rankings in a News Recommender System

There is an increasing demand for algorithms to explain their outcomes. ...

Network-based ranking in social systems: three challenges

Ranking algorithms are pervasive in our increasingly digitized societies...

The few-get-richer: a surprising consequence of popularity-based rankings

Ranking algorithms play a crucial role in online platforms ranging from ...