ResearchTrend.AI
Blackwell Approachability and Low-Regret Learning are Equivalent

Blackwell Approachability and Low-Regret Learning are Equivalent

Jacob D. Abernethy
Peter L. Bartlett
Elad Hazan
ArXiv (abs)PDFHTML

Papers citing "Blackwell Approachability and Low-Regret Learning are Equivalent"

4 / 4 papers shown
Title
Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
Improved and Oracle-Efficient Online ℓ1\ell_1-Multicalibration
Rohan Ghuge
Vidya Muthukumar
Sahil Singla
140
0
0
23 May 2025
Fast Algorithms for Online Stochastic Convex Programming
Fast Algorithms for Online Stochastic Convex Programming
Shipra Agrawal
Nikhil R. Devanur
140
175
0
28 Oct 2014
A Geometric Proof of Calibration
A Geometric Proof of Calibration
Shie Mannor
Gilles Stoltz
74
36
0
18 Dec 2009
A Stochastic View of Optimal Regret through Minimax Duality
A Stochastic View of Optimal Regret through Minimax Duality
Jacob D. Abernethy
Alekh Agarwal
Peter L. Bartlett
Alexander Rakhlin
94
93
0
30 Mar 2009

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.