Skip to content
Conference Open access

Improvements of Multi-Armed Bandit Algorithms

2026 · Proceedings of the 4th International Conference on Image, Algorithms, and Artificial Intelligence, ICIAAI 2026, 22-24 May 2026, Singapore, Singapore · 0 citations · 4 references

TL;DR

This paper overviews the paths to further improve this algorithm and identifies two major methods of improvement: the internal method focuses on changing the inner structure of the algorithm to make it more generalizable in various circumstances; the external method focuses on constructing multi-phase processes with MABs and other algorithms to utilize MAB in more complex tasks.

Abstract

. As a branch of reinforcement learning, Multi-Armed Bandit(MAB) is used in problems of making optimal decisions such as recommendation and clinical trials. It has the ability of gathering information from unknown environments and using this information to maximize the reward in a process. This paper overviews the paths to further improve this algorithm and identifies two major methods of improvement. The internal method focuses on changing the inner structure of the algorithm to make it more generalizable in various circumstances; the external method instead focuses on constructing multi-phase processes with MABs and other algorithms to utilize MAB in more complex tasks. Both paths let the resulting algorithms show better performances than those before improvements in many different realms. Depending on the application, there are many other factors in specific occasions that may influence the performance of MAB, and targeted adjustments may also be needed.

Read PDF

Similar papers

Conference Open access 2026

A Comparative Analysis of Multi-Armed Bandit Algorithms in the Research of Optimal Product Discovery in E-Commerce

: This paper investigates how the Multi-Armed Bandit (MAB) model can maximize the discovery of products of instant noodles based on the Ramen Rating data. The paper will treat recommendation as a sequential decision-making process and will compare three particular algorithms, namely, Explore-Then-Commit (ETC), Upper Co...

Tai-Lin Su · 0 citations
Review

Non‑ S tationary Multi‑Armed Bandits: Evolution and Challenges of Dynamic Decision‑Making Frameworks

This review systematically examines two types of algorithms: passive methods (e.g., sliding-window UCB, discounted UCB), which filter out outdated data’s interference through forgetting mechanisms; and active methods (e.g., TS-CD, R-BOCPD), which dynamically update their parameters by detecting changes.

Ran An · 0 citations
Conference

A Machine Learning-Based Warm Start Approach to Improve the Solvability of Optimization Problems

In this research, we explore the use of machine learning (ML) techniques, notably logistic regression and decision tree algorithms, for improving the solvability of optimization problems. Recognizing that the computational time required to solve a linear programming problem can be heavily influenced by the choice of a...

Ronit Neogy, J. Desai · 0 citations
#artificial intelligence Preprint Oct 2026

Single or Multiple Policies for Phase-Structured Reinforcement Learning?

Many reinforcement-learning (RL) problems are non-stationary yet structured and can be decomposed into phases, each with its own transition probabilities and reward functions. When the phase sequence is known, the common solution augments the state with information to satisfy the Markovian property and applies standard...

Guilhem Loussouarn, Nancy Nayak, Kin K. Leung · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.