Material Detail

Blackwell Approachability and No-Regret Learning are Equivalent

Blackwell Approachability and No-Regret Learning are Equivalent

This video was recorded at 24th Annual Conference on Learning Theory (COLT), Budapest 2011. We consider the celebrated Blackwell Approachability Theorem for two-player games with vector payoffs. Blackwell himself previously showed that the theorem implies the existence of a "no regret" algorithm for a simple online learning problem. We show that this relationship is in fact much stronger, that Blackwell's result is equivalent to, in a very strong sense, the problem of regret minimization for Online Linear Optimization. We show that any algorithm for one such problem can be efficiently converted into an algorithm for the other. We provide one novel application of this reduction: the first efficient algorithm for calibrated forecasting.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Blackwell Approachability and No-Regret Learning are Equivalent

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.