From Bandits to Experts: A Tale of Domination and Independence
read the original abstract
We consider the partial observability model for multi-armed bandits, introduced by Mannor and Shamir. Our main result is a characterization of regret in the directed observability model in terms of the dominating and independence numbers of the observability graph. We also show that in the undirected case, the learner can achieve optimal regret without even accessing the observability graph before selecting an action. Both results are shown using variants of the Exp3 algorithm operating on the observability graph in a time-efficient manner.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Do Not Trust The Auctioneer: Learning to Bid in Feedback-Manipulated Auctions
In first-price auctions with feedback-only shilling, an algorithm combining robust interval elimination and optimistic debiasing with racing achieves near-optimal regret rates of O(T^{2/3}) or O(sqrt(T)) and matches a...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.