Non-trivial two-armed partial-monitoring games are bandits

Details Non-trivial two-armed partial-monitoring games are bandits Non-trivial two-armed partial-monitoring games are bandits

2011-08-24

arxiv.org/abs/1108.4961v1

Computer Science

Learning

Scientific paper

We consider online learning in partial-monitoring games against an oblivious
adversary. We show that when the number of actions available to the learner is
two and the game is nontrivial then it is reducible to a bandit-like game and
thus the minimax regret is $\Theta(\sqrt{T})$.

Affiliated with

Also associated with

No associations

Rating

Non-trivial two-armed partial-monitoring games are bandits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-trivial two-armed partial-monitoring games are bandits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-trivial two-armed partial-monitoring games are bandits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318365