Trading-off price for data quality to achieve fair online allocation

• URL: http://arxiv.org/abs/2306.13440v2
• Date: Mon, 4 Dec 2023 15:27:00 GMT
• Title: Trading-off price for data quality to achieve fair online allocation
• Authors: Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
• Abstract summary: We consider the problem of online allocation subject to a long-term fairness penalty. We propose an algorithm that jointly solves both problems and show that it has a regret bounded by $mathcalO(sqrtT)$.
• Score: 25.154957931903525
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of online allocation subject to a long-term fairness penalty. Contrary to existing works, however, we do not assume that the decision-maker observes the protected attributes -- which is often unrealistic in practice. Instead they can purchase data that help estimate them from sources of different quality; and hence reduce the fairness penalty at some cost. We model this problem as a multi-armed bandit problem where each arm corresponds to the choice of a data source, coupled with the online allocation problem. We propose an algorithm that jointly solves both problems and show that it has a regret bounded by $\mathcal{O}(\sqrt{T})$. A key difficulty is that the rewards received by selecting a source are correlated by the fairness penalty, which leads to a need for randomization (despite a stochastic setting). Our algorithm takes into account contextual information available before the source selection, and can adapt to many different fairness notions. We also show that in some instances, the estimates used can be learned on the fly.

Related papers

• What Hides behind Unfairness? Exploring Dynamics Fairness in Reinforcement Learning [52.51430732904994]
  In reinforcement learning problems, agents must consider long-term fairness while maximizing returns. Recent works have proposed many different types of fairness notions, but how unfairness arises in RL problems remains unclear. We introduce a novel notion called dynamics fairness, which explicitly captures the inequality stemming from environmental dynamics.
  arXiv  Detail & Related papers  (2024-04-16T22:47:59Z)
• Fairness Without Harm: An Influence-Guided Active Sampling Approach [32.173195437797766]
  We aim to train models that mitigate group fairness disparity without causing harm to model accuracy. The current data acquisition methods, such as fair active learning approaches, typically require annotating sensitive attributes. We propose a tractable active data sampling algorithm that does not rely on training group annotations.
  arXiv  Detail & Related papers  (2024-02-20T07:57:38Z)
• Time Fairness in Online Knapsack Problems [6.435514551504644]
  The online knapsack problem is a classic problem in the field of online algorithms. We formalize a practically-relevant notion of time fairness which effectively models a trade off between static and dynamic pricing. We develop a nearly-optimal learning-augmented algorithm which is fair, consistent, and robust (competitive)
  arXiv  Detail & Related papers  (2023-05-22T17:51:35Z)
• Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency [90.40062452292091]
  We present the first computationally efficient algorithm for linear bandits with heteroscedastic noise. Our algorithm is adaptive to the unknown variance of noise and achieves an $tildeO(d sqrtsum_k = 1K sigma_k2 + d)$ regret. We also propose a variance-adaptive algorithm for linear mixture Markov decision processes (MDPs) in reinforcement learning.
  arXiv  Detail & Related papers  (2023-02-21T00:17:24Z)
• Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits [81.60136088841948]
  We propose an algorithm that minimizes the regret over the horizon of time $T$. The proposed algorithm is applicable to domains such as recommendation systems and transportation.
  arXiv  Detail & Related papers  (2023-01-31T03:49:00Z)
• The Power and Limitation of Pretraining-Finetuning for Linear Regression under Covariate Shift [127.21287240963859]
  We investigate a transfer learning approach with pretraining on the source data and finetuning based on the target data. For a large class of linear regression instances, transfer learning with $O(N2)$ source data is as effective as supervised learning with $N$ target data.
  arXiv  Detail & Related papers  (2022-08-03T05:59:49Z)
• Understanding Unfairness in Fraud Detection through Model and Data Bias Interactions [4.159343412286401]
  We argue that algorithmic unfairness stems from interactions between models and biases in the data. We study a set of hypotheses regarding the fairness-accuracy trade-offs that fairness-blind ML algorithms exhibit under different data bias settings.
  arXiv  Detail & Related papers  (2022-07-13T15:18:30Z)
• The price of unfairness in linear bandits with biased feedback [62.25313751895011]
  We study the problem of sequential decision making with biased linear bandit feedback. We show that the worst case regret is higher than the dT 1/2 log(T) regret rate obtained under unbiased feedback. Interestingly, the gap-dependent rates reveal the existence of non-trivial instances where the problem is no more difficult than its unbiased counterpart.
  arXiv  Detail & Related papers  (2022-03-18T08:03:20Z)
• Nonstationary Dual Averaging and Online Fair Allocation [32.85609942201268]
  We develop new online learning results for the dual averaging algorithm under nonstationary input models. Our results apply to several nonstationary input models: adversarial corruption, ergodic input, and blockindependent (including periodic) input.
  arXiv  Detail & Related papers  (2022-02-23T16:50:24Z)
• Fairer LP-based Online Allocation [13.478067250930101]
  We consider a Linear Program (LP)-based online resource allocation problem where a decision maker accepts or rejects incoming customer requests irrevocably. We propose a fair algorithm that uses an interior-point LP solver and dynamically detects unfair resource spending. Our approach do not formulate the fairness requirement as a constrain in the optimization instance, and instead we address the problem from the perspective of algorithm design.
  arXiv  Detail & Related papers  (2021-10-27T17:45:20Z)
• Algorithmic Decision Making with Conditional Fairness [48.76267073341723]
  We define conditional fairness as a more sound fairness metric by conditioning on the fairness variables. We propose a Derivable Conditional Fairness Regularizer (DCFR) to track the trade-off between precision and fairness of algorithmic decision making.
  arXiv  Detail & Related papers  (2020-06-18T12:56:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.