Skip to main content
Search

# Algorithmic Fairness

1 related articles

Subscribe to updates
  1. arXiv

    Fair graph clustering now corrects attention too: FairPGT keeps encoders group-neutral and cuts the parity gap about tenfold versus DMoN on the three largest graphs

    When communities in an attributed graph line up with protected groups, clustering inherits demographic bias, and a graph transformer's attention can itself favor same-group nodes. FairPGT restricts attention to METIS partitions linked by routing tokens, constrains statistical parity on cluster assignments with a mutual-information term, and steers encoder attention toward neutrality by self-distilling a normalized cross-group attention ratio (nCGAR). On the three largest graphs, Credit, Pokec-n and Pokec-z, it attains both the highest NMI and the lowest statistical-parity gap, about ten times lower than DMoN; on stochastic block models where communities and groups coincide, its NMI reaches 97% of the bound for any exactly fair clustering.

You’re all caught up