arXiv Machine Learning

Individual Fairness via Local Predictive Consistency

The paper introduces a node‑level relaxation of individual fairness called local predictive consistency, where each prediction is compared to a similarity‑weighted average of predictions in its local neighborhood. This approach yields an interpretable fairness score and a regularized learning method based on local residuals, and it explicitly constructs the neighborhood graph with threshold selection guided by graph‑coverage diagnostics. The authors apply the method to binary classification, regression, and time‑to‑event prediction, and compare it with pairwise constraint‑based fairness formulations to analyze fairness‑performance trade‑offs.

arXiv Machine Learning
Oct 2

FairRARI: A Plug and Play Framework for Fairness-Aware PageRank

FairRARI is a new in‑processing convex optimization framework that computes PageRank vectors while satisfying various group‑fairness constraints based on vertex attributes. By formulating PageRank as a variational problem, FairRARI solves a strongly convex problem that guarantees a target fairness level and retains the same asymptotic time complexity as standard PageRank. Experiments on real datasets show that FairRARI outperforms existing methods in utility while achieving the desired fairness across multiple vertex groups.

By Emmanouil Kariotakis, Aritra Konar
arXiv Machine Learning
Oct 16

A Model Ensemble-Based Post-Processing Framework for Fairness-Aware Prediction

The paper introduces a post‑processing framework that uses model ensembling to achieve fairness‑aware predictions. It is designed to work independently of any specific model internals, making it applicable to a wide range of learning tasks, model architectures, and fairness definitions. Experiments on classification, regression, and survival analysis show that the framework improves fairness while preserving predictive accuracy.

By Zhouting Zhao, Tin Lok James Ng
arXiv Machine Learning
Aug 28

Subgraph Filtering for Fair Graph Neural Networks

Subgraph Filtering for Fair Graph Neural Networks (SF‑GNN) is a lightweight, architecture‑agnostic framework that reduces structural bias in GNNs by identifying and filtering bias‑prone edges during message passing. It combines sensitive homophily with structural propagation amplifiers such as hub participation and triadic closure to detect problematic edges, then applies stochastic edge filtering to downweight or remove them while preserving the rest of the graph. Experiments on five benchmark datasets demonstrate that SF‑GNN consistently improves fairness while maintaining competitive predictive performance, achieving a better fairness–accuracy trade‑off than recent fairness‑aware GNN baselines.

By Haohui Lu, jiyuan Tian, Fangyu Zhou, Shahadat Uddin