Multi-armed bandits with censored consumption of resources

DOI10.1007/s10994-022-06271-zarXiv2011.00813OpenAlexW3097146586MaRDI QIDQ6097147

Eyke Hüllermeier, Viktor Bengs

Publication date: 12 June 2023

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

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

zbMATH Keywords

exploitationalgorithm selectionexplorationbivariate feedbackcensored feedback

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm portfolio selection as a bandit problem with unbounded losses
• Combinatorial bandits
• Reinforcement learning with immediate rewards and linear hypotheses
• Regret Minimization for Reserve Prices in Second-Price Auctions
• 10.1162/153244303321897663
• A Survey of Methods for Automated Algorithm Configuration
• Bandit Algorithms
• From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
• Introduction to Multi-Armed Bandits
• Prediction, Learning, and Games
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Multi-armed bandits with censored consumption of resources