Online Learning with an Unknown Fairness Metric
We consider the problem of online learning in the linear contextual bandits setting, but in which there are also strong individual fairness constraints governed by an unknown similarity metric. These constraints demand that we select similar actions or individuals with approximately equal probability (arXiv:1104.3913), which may be at odds with optimizing reward, thus modeling settings where profit and social policy are in tension. We assume we learn about an unknown Mahalanobis similarity metric from only weak feedback that identifies fairness violations, but does not quantify their extent. This is intended to represent the interventions of a regulator who "knows unfairness when he sees it" but nevertheless cannot enunciate a quantitative fairness metric over individuals. Our main result is an algorithm in the adversarial context setting that has a number of fairness violations that depends only logarithmically on $T$, while obtaining an optimal $O(\sqrt{T})$ regret bound to the best fair policy.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessMulti-Armed BanditsSimilar Papers 제목 키워드 기반
Metric-Free Individual Fairness in Online Learning
We study an online learning problem subject to the constraint of individual fairness, which requires that similar individuals are treated similarly. Unlike prior work on individual fairness, we do not assume the similari…
FairnessFormGeneral ClassificationOpen-Ended Question AnsweringFairness-aware Online Price Discrimination with Nonparametric Demand Models
Price discrimination, which refers to the strategy of setting different prices for different customer groups, has been widely used in online retailing. Although it helps boost the collected revenue for online retailers, …
FairnessOnline Task Scheduling for Fog Computing with Multi-Resource Fairness
In fog computing systems, one key challenge is online task scheduling, i.e., to decide the resource allocation for tasks that are continuously generated from end devices. The design is challenging because of various unce…
Deep Reinforcement LearningFairnessSchedulingOnline Learning with Multiple Fairness Regularizers via Graph-Structured Feedback
There is an increasing need to enforce multiple, often competing, measures of fairness within automated decision systems. The appropriate weighting of these fairness objectives is typically unknown a priori, may change o…
Long-Term Fairness with Unknown Dynamics
While machine learning can myopically reinforce social inequalities, it may also be used to dynamically seek equitable outcomes. In this paper, we formalize long-term fairness in the context of online reinforcement learn…
Deep Reinforcement LearningFairnessreinforcement-learningReinforcement Learning