Constrained regret minimization for multi-criterion multi-armed bandits

DOI10.1007/S10994-022-06291-9arXiv2006.09649OpenAlexW3036324443MaRDI QIDQ6155194

Anmol Kagrecha, Krishna Jagannathan, Jayakrishnan Nair

Publication date: 12 June 2023

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.09649

zbMATH Keywords

regret minimizationconstrained banditsmulti-criterion multi-armed bandits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Asymptotically efficient adaptive allocation rules
• Robust Risk-Averse Stochastic Multi-armed Bandits
• Pure Exploration in Multi-armed Bandits Problems
• Bandits with Knapsacks
• Multi-objective Contextual Multi-armed Bandit With a Dominant Objective
• Safe Linear Thompson Sampling With Side Information
• Bandit Algorithms
• Multicriteria Optimization
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

This page was built for publication: Constrained regret minimization for multi-criterion multi-armed bandits