Blackwell Approachability and Low-Regret Learning are Equivalent

Details Blackwell Approachability and Low-Regret Learning are Equivalent Blackwell Approachability and Low-Regret Learning are Equivalent

2010-11-08

arxiv.org/abs/1011.1936v1

Computer Science

Learning

Scientific paper

We consider the celebrated Blackwell Approachability Theorem for two-player games with vector payoffs. We show that Blackwell's result is equivalent, via efficient reductions, to the existence of "no-regret" algorithms for Online Linear Optimization. Indeed, we show that any algorithm for one such problem can be efficiently converted into an algorithm for the other. We provide a useful application of this reduction: the first efficient algorithm for calibrated forecasting.

Affiliated with

Also associated with

No associations

Rating

Blackwell Approachability and Low-Regret Learning are Equivalent 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 Blackwell Approachability and Low-Regret Learning are Equivalent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blackwell Approachability and Low-Regret Learning are Equivalent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492160