ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1011.1936
  4. Cited By
Blackwell Approachability and Low-Regret Learning are Equivalent

Blackwell Approachability and Low-Regret Learning are Equivalent

8 November 2010
Jacob D. Abernethy
Peter L. Bartlett
Elad Hazan
ArXivPDFHTML

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

4 / 4 papers shown
Title
Calibrated Probabilistic Forecasts for Arbitrary Sequences
Calibrated Probabilistic Forecasts for Arbitrary Sequences
Charles Marx
Volodymyr Kuleshov
Stefano Ermon
AI4TS
21
1
0
27 Sep 2024
Rate-Preserving Reductions for Blackwell Approachability
Rate-Preserving Reductions for Blackwell Approachability
Christoph Dann
Yishay Mansour
M. Mohri
Jon Schneider
Balasubramanian Sivan
27
2
0
10 Jun 2024
Pseudonorm Approachability and Applications to Regret Minimization
Pseudonorm Approachability and Applications to Regret Minimization
Christoph Dann
Yishay Mansour
M. Mohri
Jon Schneider
Balasubramanian Sivan
11
5
0
03 Feb 2023
Online Learning with Continuous Variations: Dynamic Regret and
  Reductions
Online Learning with Continuous Variations: Dynamic Regret and Reductions
Ching-An Cheng
Jonathan Lee
Ken Goldberg
Byron Boots
14
16
0
19 Feb 2019
1