Toward Unifying Group Fairness Evaluation from a Sparsity Perspective

• URL: http://arxiv.org/abs/2511.00359v1
• Date: Sat, 01 Nov 2025 02:02:11 GMT
• Title: Toward Unifying Group Fairness Evaluation from a Sparsity Perspective
• Authors: Zhecheng Sheng, Jiawei Zhang, Enmao Diao,
• Abstract summary: We propose a unified sparsity-based framework for evaluating algorithmic fairness.<n>The framework aligns with existing fairness criteria and demonstrates broad applicability to a wide range of machine learning tasks.
• Score: 14.456880823997757
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Ensuring algorithmic fairness remains a significant challenge in machine learning, particularly as models are increasingly applied across diverse domains. While numerous fairness criteria exist, they often lack generalizability across different machine learning problems. This paper examines the connections and differences among various sparsity measures in promoting fairness and proposes a unified sparsity-based framework for evaluating algorithmic fairness. The framework aligns with existing fairness criteria and demonstrates broad applicability to a wide range of machine learning tasks. We demonstrate the effectiveness of the proposed framework as an evaluation metric through extensive experiments on a variety of datasets and bias mitigation methods. This work provides a novel perspective to algorithmic fairness by framing it through the lens of sparsity and social equity, offering potential for broader impact on fairness research and applications.

Related papers

• Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective [28.68227117674221]
  This paper proposes a theoretical framework for analyzing fairness generalization error through an information-theoretic lens.<n>Our empirical results validate the tightness and practical relevance of these bounds across diverse fairness-aware learning algorithms.
  arXiv  Detail & Related papers  (2025-06-09T15:24:56Z)
• A Benchmark for Fairness-Aware Graph Learning [58.515305543487386]
  We present an extensive benchmark on ten representative fairness-aware graph learning methods. Our in-depth analysis reveals key insights into the strengths and limitations of existing methods.
  arXiv  Detail & Related papers  (2024-07-16T18:43:43Z)
• Fair Few-shot Learning with Auxiliary Sets [53.30014767684218]
  In many machine learning (ML) tasks, only very few labeled data samples can be collected, which can lead to inferior fairness performance. In this paper, we define the fairness-aware learning task with limited training samples as the emphfair few-shot learning problem. We devise a novel framework that accumulates fairness-aware knowledge across different meta-training tasks and then generalizes the learned knowledge to meta-test tasks.
  arXiv  Detail & Related papers  (2023-08-28T06:31:37Z)
• FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods [84.1077756698332]
  This paper introduces the Fair Fairness Benchmark (textsfFFB), a benchmarking framework for in-processing group fairness methods. We provide a comprehensive analysis of state-of-the-art methods to ensure different notions of group fairness.
  arXiv  Detail & Related papers  (2023-06-15T19:51:28Z)
• Fairness meets Cross-Domain Learning: a new perspective on Models and Metrics [80.07271410743806]
  We study the relationship between cross-domain learning (CD) and model fairness. We introduce a benchmark on face and medical images spanning several demographic groups as well as classification and localization tasks. Our study covers 14 CD approaches alongside three state-of-the-art fairness algorithms and shows how the former can outperform the latter.
  arXiv  Detail & Related papers  (2023-03-25T09:34:05Z)
• Individual Fairness under Uncertainty [26.183244654397477]
  Algorithmic fairness is an established area in machine learning (ML) algorithms. We propose an individual fairness measure and a corresponding algorithm that deal with the challenges of uncertainty arising from censorship in class labels. We argue that this perspective represents a more realistic model of fairness research for real-world application deployment.
  arXiv  Detail & Related papers  (2023-02-16T01:07:58Z)
• Increasing Fairness via Combination with Learning Guarantees [8.116369626226815]
  We propose a fairness quality measure named 'discriminative risk (DR)' to reflect both individual and group fairness aspects.<n>We investigate its properties and establish the first- and second-order oracle bounds to show that fairness can be boosted via ensemble combination with theoretical learning guarantees.
  arXiv  Detail & Related papers  (2023-01-25T20:31:06Z)
• MultiFair: Multi-Group Fairness in Machine Learning [52.24956510371455]
  We study multi-group fairness in machine learning (MultiFair) We propose a generic end-to-end algorithmic framework to solve it. Our proposed framework is generalizable to many different settings.
  arXiv  Detail & Related papers  (2021-05-24T02:30:22Z)
• Through the Data Management Lens: Experimental Analysis and Evaluation of Fair Classification [75.49600684537117]
  Data management research is showing an increasing presence and interest in topics related to data and algorithmic fairness. We contribute a broad analysis of 13 fair classification approaches and additional variants, over their correctness, fairness, efficiency, scalability, and stability. Our analysis highlights novel insights on the impact of different metrics and high-level approach characteristics on different aspects of performance.
  arXiv  Detail & Related papers  (2021-01-18T22:55:40Z)

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.