A Survey on Fairness for Machine Learning on Graphs
- URL: http://arxiv.org/abs/2205.05396v2
- Date: Wed, 21 Feb 2024 22:25:01 GMT
- Title: A Survey on Fairness for Machine Learning on Graphs
- Authors: Charlotte Laclau and Christine Largeron and Manvi Choudhary
- Abstract summary: This survey is the first one dedicated to fairness for relational data.
It aims to present a comprehensive review of state-of-the-art techniques in fairness on graph mining.
- Score: 2.3326951882644553
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Nowadays, the analysis of complex phenomena modeled by graphs plays a crucial
role in many real-world application domains where decisions can have a strong
societal impact. However, numerous studies and papers have recently revealed
that machine learning models could lead to potential disparate treatment
between individuals and unfair outcomes. In that context, algorithmic
contributions for graph mining are not spared by the problem of fairness and
present some specific challenges related to the intrinsic nature of graphs: (1)
graph data is non-IID, and this assumption may invalidate many existing studies
in fair machine learning, (2) suited metric definitions to assess the different
types of fairness with relational data and (3) algorithmic challenge on the
difficulty of finding a good trade-off between model accuracy and fairness.
This survey is the first one dedicated to fairness for relational data. It aims
to present a comprehensive review of state-of-the-art techniques in fairness on
graph mining and identify the open challenges and future trends. In particular,
we start by presenting several sensible application domains and the associated
graph mining tasks with a focus on edge prediction and node classification in
the sequel. We also recall the different metrics proposed to evaluate potential
bias at different levels of the graph mining process; then we provide a
comprehensive overview of recent contributions in the domain of fair machine
learning for graphs, that we classify into pre-processing, in-processing and
post-processing models. We also propose to describe existing graph data,
synthetic and real-world benchmarks. Finally, we present in detail five
potential promising directions to advance research in studying algorithmic
fairness on graphs.
Related papers
- A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation [59.14165404728197]
We provide an up-to-date and forward-looking review of deep graph learning under distribution shifts.
Specifically, we cover three primary scenarios: graph OOD generalization, training-time graph OOD adaptation, and test-time graph OOD adaptation.
To provide a better understanding of the literature, we systematically categorize the existing models based on our proposed taxonomy.
arXiv Detail & Related papers (2024-10-25T02:39:56Z) - Towards Graph Prompt Learning: A Survey and Beyond [38.55555996765227]
Large-scale "pre-train and prompt learning" paradigms have demonstrated remarkable adaptability.
This survey categorizes over 100 relevant works in this field, summarizing general design principles and the latest applications.
arXiv Detail & Related papers (2024-08-26T06:36:42Z) - 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) - Graph Learning under Distribution Shifts: A Comprehensive Survey on
Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning.
We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning.
We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
arXiv Detail & Related papers (2024-02-26T07:52:40Z) - Few-Shot Learning on Graphs: from Meta-learning to Pre-training and
Prompting [56.25730255038747]
This survey endeavors to synthesize recent developments, provide comparative insights, and identify future directions.
We systematically categorize existing studies into three major families: meta-learning approaches, pre-training approaches, and hybrid approaches.
We analyze the relationships among these methods and compare their strengths and limitations.
arXiv Detail & Related papers (2024-02-02T14:32:42Z) - A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and
Future Directions [64.84521350148513]
Graphs represent interconnected structures prevalent in a myriad of real-world scenarios.
Effective graph analytics, such as graph learning methods, enables users to gain profound insights from graph data.
However, these methods often suffer from data imbalance, a common issue in graph data where certain segments possess abundant data while others are scarce.
This necessitates the emerging field of imbalanced learning on graphs, which aims to correct these data distribution skews for more accurate and representative learning outcomes.
arXiv Detail & Related papers (2023-08-26T09:11:44Z) - 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) - Fairness in Graph Mining: A Survey [36.34373832850891]
Graph mining algorithms could lead to discrimination towards certain populations when exploited in human-centered applications.
We propose a novel taxonomy of fairness notions on graphs, which sheds light on their connections and differences.
We present an organized summary of existing techniques that promote fairness in graph mining.
arXiv Detail & Related papers (2022-04-21T05:26:54Z) - Fairness-Aware Node Representation Learning [9.850791193881651]
This study addresses fairness issues in graph contrastive learning with fairness-aware graph augmentation designs.
Different fairness notions on graphs are introduced, which serve as guidelines for the proposed graph augmentations.
Experimental results on real social networks are presented to demonstrate that the proposed augmentations can enhance fairness in terms of statistical parity and equal opportunity.
arXiv Detail & Related papers (2021-06-09T21:12:14Z)
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.