A Unified Approach to Fair Online Learning via Blackwell Approachability

v1v2 (latest)

A Unified Approach to Fair Online Learning via Blackwell Approachability

23 June 2021

Christophe Giraud

ArXiv (abs)PDF HTML

Papers citing "A Unified Approach to Fair Online Learning via Blackwell Approachability"

8 / 8 papers shown

Title
Computing Optimal Regularizers for Online Linear Optimization Khashayar Gatmiry Jon Schneider Stefanie Jegelka 53 1 0 22 Oct 2024
Rate-Preserving Reductions for Blackwell Approachability Christoph Dann Yishay Mansour M. Mohri Jon Schneider Balasubramanian Sivan 72 4 0 10 Jun 2024
Group-blind optimal transport to group parity and its constrained variants Quan-Gen Zhou Georgios Korpas 75 3 0 17 Oct 2023
Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness Evgenii Chzhen Christophe Giraud Zerui Li Gilles Stoltz 51 1 0 25 May 2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint Marwa El Halabi Federico Fusco A. Norouzi-Fard Jakab Tardos Jakub Tarnawski 59 8 0 24 May 2023
Pseudonorm Approachability and Applications to Regret Minimization Christoph Dann Yishay Mansour M. Mohri Jon Schneider Balasubramanian Sivan 72 7 0 03 Feb 2023
The price of unfairness in linear bandits with biased feedback Solenne Gaucher Alexandra Carpentier Christophe Giraud FaML 40 2 0 18 Mar 2022
Solving optimization problems with Blackwell approachability Julien Grand-Clément Christian Kroer 48 5 0 24 Feb 2022