The Comparison of Multi-Armed-Bandit Algorithms in Movie Recommendation Systems

With the development of information technology, especially the Internet, people are rapidly moving from the era of information scarcity to the era of information overload. Recommendation systems have thus rapidly developed, which aims to find the optimization of the experience for users. The Multi-Armed-Bandit (MAB) algorithms belong to the category of reinforcement learning , always trying to optimize the balance between exploration and exploitation trade-offs. This fundamental principle successfully coincides the application of recommendation systems. By using a large number of real user ratings of movies as the data-set, this paper compares the performances of various MAB algorithms, ε-greedy, Explore-Then-Commit (ETC), Upper Confidence Bound (UCB), Asymptotically optimal UCB and Thompson Sampling (TS) in the movie recommendation system. Through the performance of different algorithms on the same data, it is concluded that the TS algorithm performs relatively optimally in improving the efficiency of the system. Since the basic principle of TS algorithm utilizes Bayesian inference, the balance of each selection trade-off can more probably be better than other algorithms. TS algorithm has a strong flexibility and can perform a better balance when facing different environments. In addition, the methodological framework of this paper can be drawn upon in more complex scenarios and environments.

Authors

Institutions

Publication Details

Journal
Applied and Computational Engineering
Published
2026-11-17
DOI
https://doi.org/10.54254/2755-2721/2026.ld39100
Primary Topic
Advanced Bandit Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

The Comparison of Multi-Armed-Bandit Algorithms in Movie Recommendation Systems

Ruiyang Ye
3 links
Applied and Computational Engineering
Advanced Bandit Algorithms Research
article

The Comparison of Multi-Armed-Bandit Algorithms in Movie Recommendation Systems

Ruiyang Ye
article en

Abstract

With the development of information technology, especially the Internet, people are rapidly moving from the era of information scarcity to the era of information overload. Recommendation systems have thus rapidly developed, which aims to find the optimization of the experience for users. The Multi-Armed-Bandit (MAB) algorithms belong to the category of reinforcement learning , always trying to optimize the balance between exploration and exploitation trade-offs. This fundamental principle successfully coincides the application of recommendation systems. By using a large number of real user ratings of movies as the data-set, this paper compares the performances of various MAB algorithms, ε-greedy, Explore-Then-Commit (ETC), Upper Confidence Bound (UCB), Asymptotically optimal UCB and Thompson Sampling (TS) in the movie recommendation system. Through the performance of different algorithms on the same data, it is concluded that the TS algorithm performs relatively optimally in improving the efficiency of the system. Since the basic principle of TS algorithm utilizes Bayesian inference, the balance of each selection trade-off can more probably be better than other algorithms. TS algorithm has a strong flexibility and can perform a better balance when facing different environments. In addition, the methodological framework of this paper can be drawn upon in more complex scenarios and environments.

Applied and Computational EngineeringVol. 285(1)
Hong Kong Polytechnic University (HK)
Advanced Bandit Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon