Resource-constrained Fairness

• URL: http://arxiv.org/abs/2406.01290v5
• Date: Fri, 07 Feb 2025 19:54:49 GMT
• Title: Resource-constrained Fairness
• Authors: Sofie Goethals, Eoin Delaney, Brent Mittelstadt, Chris Russell,
• Abstract summary: Our research introduces the concept of "resource-constrained fairness" and quantifies the cost of fairness within this framework.<n>We demonstrate that the level of available resources significantly influences this cost, a factor overlooked in previous evaluations.
• Score: 6.5549655910531195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Access to resources strongly constrains the decisions we make. While we might wish to offer every student a scholarship, or schedule every patient for follow-up meetings with a specialist, limited resources mean that this is not possible. When deploying machine learning systems, these resource constraints are simply enforced by varying the threshold of a classifier. However, these finite resource limitations are disregarded by most existing tools for fair machine learning, which do not allow the specification of resource limitations and do not remain fair when varying thresholds. This makes them ill-suited for real-world deployment. Our research introduces the concept of "resource-constrained fairness" and quantifies the cost of fairness within this framework. We demonstrate that the level of available resources significantly influences this cost, a factor overlooked in previous evaluations.

Related papers

• Fairness in Limited Resources Settings [0.48127184936824546]
  In recent years many important societal decisions are made by machine-learning algorithms.<n>We consider both the prediction aspect of the decision and the resource allocation aspect.<n>In this work we focus on the fairness of the decisions in such settings.
  arXiv  Detail & Related papers  (2026-02-26T14:07:05Z)
• Capacity-Constrained Continual Learning [64.70016365121081]
  This paper studies how agents with limited capacity should allocate their resources for optimal performance.<n>We derive a solution to the capacity-constrained linear-quadratic-Gaussian sequential prediction problem.<n>For problems that can be decomposed into a set of sub-problems, we also demonstrate how to optimally allocate capacity across these sub-problems in the steady state.
  arXiv  Detail & Related papers  (2025-07-29T03:47:22Z)
• No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! [56.80767500991973]
  We focus on two canonical settings: $(i)$ online resource allocation where rewards and costs are observed before action selection, and $(ii)$ online learning with resource constraints where they are observed after action selection, under full feedback or bandit feedback.<n>It is well known that achieving sublinear regret in these settings is impossible when reward and cost distributions may change arbitrarily over time.<n>We design general (primal-)dual methods that achieve sublinear regret with respect to baselines that follow the spending plan. Crucially, the performance of our algorithms improves when the spending plan ensures a well-balanced distribution of the budget
  arXiv  Detail & Related papers  (2025-06-16T08:42:31Z)
• Auditing Fairness under Unobserved Confounding [56.61738581796362]
  We show that, surprisingly, one can still compute meaningful bounds on treatment rates for high-risk individuals. We use the fact that in many real-world settings we have data from prior to any allocation to derive unbiased estimates of risk.
  arXiv  Detail & Related papers  (2024-03-18T21:09:06Z)
• Equitable-FL: Federated Learning with Sparsity for Resource-Constrained Environment [10.980548731600116]
  We propose a sparse form of federated learning that performs well in a Resource Constrained Environment. Our goal is to make learning possible, regardless of a node's space, computing, or bandwidth scarcity. Results obtained from experiments performed for training convolutional neural networks validate the efficacy of Equitable-FL.
  arXiv  Detail & Related papers  (2023-09-02T08:40:17Z)
• Resilient Constrained Learning [94.27081585149836]
  This paper presents a constrained learning approach that adapts the requirements while simultaneously solving the learning task. We call this approach resilient constrained learning after the term used to describe ecological systems that adapt to disruptions by modifying their operation.
  arXiv  Detail & Related papers  (2023-06-04T18:14:18Z)
• Operating critical machine learning models in resource constrained regimes [0.18416014644193066]
  We investigate the trade-off between resource consumption and performance of deep learning models. Deep learning models are used in critical settings such as in clinics.
  arXiv  Detail & Related papers  (2023-03-17T12:02:08Z)
• Online Learning with Knapsacks: the Best of Both Worlds [54.28273783164608]
  We casting online learning problems in which a decision maker wants to maximize their expected reward without violating a finite set of $m$m resource constraints. Our framework allows the decision maker to handle its evidence flexibility and costoretic functions.
  arXiv  Detail & Related papers  (2022-02-28T12:10:48Z)
• Constrained Learning with Non-Convex Losses [119.8736858597118]
  Though learning has become a core technology of modern information processing, there is now ample evidence that it can lead to biased, unsafe, and prejudiced solutions.
  arXiv  Detail & Related papers  (2021-03-08T23:10:33Z)
• A Robust and Domain-Adaptive Approach for Low-Resource Named Entity Recognition [18.871792902695855]
  We propose a robust and domain-adaptive approach RDANER for low-resource NER. Our approach achieves the best performance when only using cheap and easily obtainable resources.
  arXiv  Detail & Related papers  (2021-01-02T06:47:01Z)
• Online Learning Demands in Max-min Fairness [91.37280766977923]
  We describe mechanisms for the allocation of a scarce resource among multiple users in a way that is efficient, fair, and strategy-proof. The mechanism is repeated for multiple rounds and a user's requirements can change on each round. At the end of each round, users provide feedback about the allocation they received, enabling the mechanism to learn user preferences over time.
  arXiv  Detail & Related papers  (2020-12-15T22:15:20Z)
• Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations [91.02019381927236]
  We introduce a novel method to steer the agents toward a stable population state, fulfilling the given resource constraints. The proposed method is a decentralized resource pricing method based on the resource loads resulting from the augmentation of the game's Lagrangian.
  arXiv  Detail & Related papers  (2020-10-21T10:11:17Z)
• Hierarchical Adaptive Contextual Bandits for Resource Constraint based Recommendation [49.69139684065241]
  Contextual multi-armed bandit (MAB) achieves cutting-edge performance on a variety of problems. In this paper, we propose a hierarchical adaptive contextual bandit method (HATCH) to conduct the policy learning of contextual bandits with a budget constraint.
  arXiv  Detail & Related papers  (2020-04-02T17:04:52Z)
• Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches [13.327676224001257]
  We study the impact of limited switches on resource-constrained dynamic pricing with demand learning.<n>Our algorithms maintain strong cumulative reward performance while significantly reducing the number of switches.
  arXiv  Detail & Related papers  (2019-11-04T07:58:37Z)

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.