A Unified Approach to Fair Online Learning via Blackwell Approachability
Not on the map. Why?
Abstract (arXiv)
We provide a setting and a general approach to fair online learning with stochastic sensitive and non-sensitive contexts. The setting is a repeated game between the Player and Nature, where at each stage both pick actions based on the contexts. Inspired by the notion of unawareness, we assume that the Player can only access the non-sensitive context before making a decision, while we discuss both cases of Nature accessing the sensitive contexts and Nature unaware of the sensitive contexts. Adapting Blackwell's approachability theory to handle the case of an unknown contexts' distribution, we provide a general necessary and sufficient condition for learning objectives to be compatible with some fairness constraints. This condition is instantiated on (group-wise) no-regret and (group-wise) calibration objectives, and on demographic parity as an additional constraint. When the objective is not compatible with the constraint, the provided framework permits to characterise the optimal trade-off between the two.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 10 of its 28 references that are in the map. First posted on arXiv 23 Jun 2021.
Builds on
10 of 28 references.
References · 10
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2016Fair prediction with disparate impact: A study of bias in recidivism prediction instrumentscited by 671
- 2017On Fairness and Calibrationcited by 406
- 2020Minimax Pareto Fairness: A Multi Objective Perspectivecited by 152
- 2017On Formalizing Fairness in Prediction with Machine Learningcited by 65
- 2021Online Multivalid Learning: Means, Moments, and Prediction Intervalscited by 48
- 2019Equal Opportunity in Online Classification with Partial Feedbackcited by 34
- 2013Approachability, Regret and Calibration; implications and equivalencescited by 18
- 2018On preserving non-discrimination when combining expert advicecited by 12
- 2013A Primal Condition for Approachability with Partial Monitoringcited by 2
Built on by
Citing papers per year: 2022: 2; 2023: 5; 2024: 2; 2025: 0; 2026: 3.
12 papers.
- 2023Pseudonorm Approachability and Applications to Regret Minimizationcited by 5
- 2022Solving optimization problems with Blackwell approachabilitycited by 4
- 2023Group-blind optimal transport to group parity and its constrained variantscited by 4
- 2024Rate-Preserving Reductions for Blackwell Approachabilitycited by 4
- 2024Computing Optimal Regularizers for Online Linear Optimizationcited by 4
- 2022The price of unfairness in linear bandits with biased feedbackcited by 3
- 2023Fairness in Streaming Submodular Maximization over a Matroid Constraintcited by 3
- 2023Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairnesscited by 2
- 2026Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Lossescited by 1
- 2023Time-Dependent Blackwell Approachability and Application to Absorbing Gamescited by 0
- 2026Efficient Opportunistic Approachabilitycited by 0
- 2026The Theorems of Dr. David Blackwell and Their Contributions to Artificial Intelligencecited by 0
- 2026The Theorems of Dr. David Blackwell and Their Contributions to Artificial Intelligence8 Apr 2026
- 2026Efficient Opportunistic Approachability24 Feb 2026
- 2026Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses7 Feb 2026
- 2024Computing Optimal Regularizers for Online Linear Optimization22 Oct 2024
- 2024Rate-Preserving Reductions for Blackwell Approachability10 Jun 2024
- 2023Group-blind optimal transport to group parity and its constrained variants17 Oct 2023
- 2023Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness25 May 2023
- 2023Fairness in Streaming Submodular Maximization over a Matroid Constraint24 May 2023
- 2023Time-Dependent Blackwell Approachability and Application to Absorbing Games9 Mar 2023
- 2023Pseudonorm Approachability and Applications to Regret Minimization3 Feb 2023
- 2022The price of unfairness in linear bandits with biased feedback18 Mar 2022
- 2022Solving optimization problems with Blackwell approachability24 Feb 2022