arXiv AI By Ella Has, Harshith Kumar Yadav, Gaurav Dixit, Mykola Pechenizkiy, Akrati Saxena

Fairness-Aware Network Embeddings: Methods, Applications, and Challenges

Read the original on arXiv AI →

arXiv:2608. 19381v1 Announce Type: cross Abstract: Network embedding methods learn low-dimensional representations of graph-structured data to support downstream tasks such as node classification, link prediction, and influence maximization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 25

Fairness-Aware Mixture-of-Experts via Subgroup Reweighting and Gate Regularization

The paper proposes a fairness-aware Mixture-of-Experts (MoE) framework that tackles routing-induced bias by applying subgroup reweighting to correct data imbalance and gate entropy regularization to prevent the gating network from collapsing onto subgroup attributes. This end-to-end approach keeps expert utilization balanced and interpretable, offering a clear view of how subgroups are allocated across experts. Experiments show that the method improves fairness while maintaining competitive predictive performance.

By Sunhee Hwang
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