conftrace_

blackwell approachability

16 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret minimization (315) multi-criteria optimization (7) repeated game (30) game theory (854) extensive-form game (86) regret bound (1926) online mirror descent (40) nash equilibrium (398) predictive online mirror descent (1)

Papers

Efficient Opportunistic Approachability ALT 2026
Extensive-Form Game Solving via Blackwell Approachability on Treeplexes NIPS 2024
Faster Recalibration of an Online Predictor via Approachability AISTATS 2024
Dueling over Dessert, Mastering the Art of Repeated Cake Cutting NIPS 2024
Provably Efficient Algorithms for Multi-Objective Competitive RL ICML 2021
A Unified Approach to Fair Online Learning via Blackwell Approachability NIPS 2021
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021
Refined approachability algorithms and application to regret minimization with global costs JMLR 2021
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NIPS 2020
Preference learning along multiple criteria: A game-theoretic perspective NIPS 2020
No-regret algorithms for online $k$-submodular maximization AISTATS 2019
Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates AISTATS 2017
Online Learning and Blackwell Approachability in Quitting Games COLT 2016
Approachability, fast and slow COLT 2013
Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011
Online Learning: Beyond Regret COLT 2011