JOURNAL ARTICLE

Correlated Gaussian Multi-Objective Multi-Armed Bandit Across Arms Algorithm

Abstract

Stochastic multi-objective multi-Armed bandit problem, (MOMAB), is a stochastic multi-Armed problem where each arm generates a vector of rewards instead of a single scalar reward. The goal of (MOMAB) is to minimize the regret of playing suboptimal arms while playing fairly the Pareto optimal arms. In this paper, we consider Gaussian correlation across arms in (MOMAB), meaning that the generated reward vector of an arm gives us information not only about that arm itself but also on all the available arms. We call this framework the correlated-MOMAB problem. We extended Gittins index policy to correlated (MOMAB) because Gittins index has been used before to model the correlation between arms. We empirically compared Gittins index policy with multi-objective upper confidence bound policy on a test suite of correlated-MOMAB problems. We conclude that the performance of these policies depend on the number of arms and objectives.

Keywords:
Regret Multi-armed bandit Thompson sampling Mathematical optimization Gaussian Computer science Index (typography) Upper and lower bounds Scalar (mathematics) Mathematics Algorithm Machine learning

Metrics

3
Cited By
0.36
FWCI (Field Weighted Citation Impact)
16
Refs
0.73
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Bandit Algorithms Research
Social Sciences →  Decision Sciences →  Management Science and Operations Research
Advanced Multi-Objective Optimization Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Reinforcement Learning in Robotics
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.