← Latest papers
🤖 machine learning

Fairness in Link Prediction Beyond Demographic Parity: A Reproducibility Study

This reproducibility study demonstrates that the proposed rank-aware NDKL metric and the MORAL post-processing method effectively uncover and mitigate exposure biases in link prediction that are overlooked by traditional demographic parity, while maintaining competitive utility across diverse settings.

Original authors: Valentijn Oldenburg, Floris de Kam, Stef de Wildt, Jarno Nilson Balk

Published 2026-08-11
📖 6 min read🧠 Deep dive

Original authors: Valentijn Oldenburg, Floris de Kam, Stef de Wildt, Jarno Nilson Balk

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are the captain of a massive digital ship, steering a fleet of recommendations through the vast ocean of the internet. Every time you suggest a new friend, a job candidate, or a service, you are essentially placing a link between two people. In the world of machine learning, this is called link prediction. But here's the catch: just because you can predict a link doesn't mean you should treat everyone equally. If your ship's compass is slightly off, you might keep steering the same groups of people toward each other while leaving others stranded in the dark. This is the problem of fairness.

For a long time, scientists used a simple rule called Demographic Parity to check if their ship was fair. Think of it like counting how many passengers from Group A and Group B are on the deck. If the numbers are roughly equal, the captain assumes everyone is being treated fairly. But this paper argues that this rule is like checking the passenger count without looking at where they are sitting. If Group A is all in the VIP lounge at the front of the ship (getting all the attention) and Group B is crammed in the cargo hold at the back (getting ignored), the total count might still look balanced, but the experience is wildly unfair. This is the difference between just "being there" and getting exposure—the chance to be seen and chosen.

The researchers in this study, a team of students from the University of Amsterdam, decided to test a new theory about this "exposure bias." They wanted to see if the old rule (Demographic Parity) was hiding the real problem and if a new, more sensitive ruler could fix it. They didn't just take the original idea for granted; they rebuilt the experiment from the ground up, fixed some broken tools they found along the way, and even created their own stormy seas to see if the new compass held up. What they found suggests that to truly be fair, we need to look not just at who gets a link, but where that link appears in the list of suggestions.

The Story of the Paper

The paper, titled "Fairness in Link Prediction Beyond Demographic Parity: A Reproducibility Study," is essentially a detective story about fairness in computer algorithms. The authors, Valentijn Oldenburg, Floris de Kam, Stef de Wildt, and Jarno Balk, set out to verify a claim made by another team of researchers (Mattos et al., 2025). The original team argued that the standard way of measuring fairness was flawed because it ignored the ranking of links.

To understand the problem, imagine a music playlist. If a playlist is supposed to be fair, it shouldn't just play an equal number of songs from Artist A and Artist B. It matters when they play. If Artist A's songs are always at the top (where people actually listen), and Artist B's songs are buried at the bottom (where no one scrolls), the playlist is biased, even if the total number of songs is the same. In the world of link prediction, this "top of the list" is where the exposure happens. The old rule, Demographic Parity, was like counting the total songs and saying, "Hey, we have 50 from A and 50 from B, so we are fair!" The new rule, called NDKL, looks at the playlist order and asks, "Wait, why are all of A's songs in the first ten tracks?"

The authors of this paper did three main things:

  1. They Rebuilt the Experiment: They took the code and methods from the original 2025 study and tried to reproduce the results. They found that the original code had some bugs and inconsistencies. After fixing these, they confirmed the original team's main findings: the old rule (Demographic Parity) does hide unfairness, and the new rule (NDKL) does catch it.
  2. They Tested the "Fix": The original study proposed a method called MORAL to fix the problem. MORAL is like a smart DJ that rearranges the playlist after the songs are picked. It takes the initial suggestions and shuffles them so that different groups get a fair shot at the top spots, without ruining the quality of the music. The authors found that MORAL successfully reduced the unfair exposure bias while keeping the recommendations useful.
  3. They Stressed the System: To make sure this wasn't just a fluke, they created their own "stress tests." They built fake social networks with different levels of homophily (the tendency for people to connect with others like themselves). They found that even when the networks were tricky or the groups were small, MORAL still managed to keep things fair. They also tested what happens when there are more than just two groups (like adding a third or fourth category), and the system held up well, though it got a bit harder to balance as the groups got smaller.

What They Found

The study confirms that Demographic Parity is a poor proxy for fairness when it comes to ranked lists. It suggests that relying on it is like judging a race by how many people finished, ignoring who actually won the gold medal. The new metric, NDKL, is much better at spotting when one group is being systematically pushed to the bottom of the list.

The MORAL method, which acts as a post-processing "re-ranker," was shown to be highly effective. In their experiments across six different real-world datasets (including social networks and credit data), MORAL consistently reduced the exposure bias. For example, on the "Facebook" dataset, the new method brought the fairness score down to near zero (meaning very little bias), while keeping the accuracy of the predictions high.

The authors also discovered that the system is robust. Even when they simulated networks where one group was very small or where people only liked to connect with their own kind (high homophily), MORAL still managed to distribute exposure fairly. However, they noted a trade-off: as the number of different groups increased, it became slightly harder to balance everyone perfectly, and the system needed more computing power. But even then, the top recommendations remained accurate.

The Bottom Line

This paper doesn't claim to have solved every problem in AI fairness, but it strongly suggests that we need to change how we measure it. If we care about who gets seen and who gets ignored, we can't just count heads; we have to look at the seating chart. The study shows that by using a metric that respects the order of the list (like NDKL) and a method that actively rearranges the list to be fair (like MORAL), we can build systems that are not only accurate but also genuinely fair to all groups, no matter how small or hidden they might be. The authors have even released their corrected code so that others can check their work and build upon it, ensuring that the path to fair AI is open for everyone to walk.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →