Improved algorithms for bandit with graph feedback via regret decomposition

DOI10.1016/j.tcs.2023.114200arXiv2205.15076MaRDI QIDQ6057842

No author found.

Publication date: 26 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

online learningmulti-armed banditgraph feedbackonline stochastic mirror descent

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• The weighted majority algorithm
• A decision-theoretic generalization of on-line learning and an application to boosting
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
• The Nonstochastic Multiarmed Bandit Problem
• Some aspects of the sequential design of experiments

This page was built for publication: Improved algorithms for bandit with graph feedback via regret decomposition