Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This paper addresses the critical challenge of temporal fairness in deployed machine learning models, specifically analyzing how feedback loops can exacerbate selection bias and distribution shifts over time. By proposing a taxonomy for static versus temporal fairness notions, it outlines key open questions necessary to prevent algorithmic unfairness from worsening during long-term deployment. The work provides a foundational framework for researchers aiming to measure and mitigate dynamic biases in real-world AI systems.
Surse care acoperăarXiv, itbusinessnet.com
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Algorithmic Fairness Over Time: Advances & Prospects

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2610.15015v1 Announce Type: new Abstract: In the presence of feedback loops, algorithmic decisions at one time step can influence observed data in subsequent steps, potentially introducing selection bias or shifts in data distribution. Research has demonstrated that ignoring these effects can lead to unfairness, which may worsen over time as the model remains deployed within society. This raises important questions of how to measure and ensure fairness of algorithmic decision-making models over time. In this short paper, we present a taxonomy that distinguishes between different types of static and temporal fairness notions in recent advancements. We then suggest prospects for future research by identifying common implicit temporal assumptions, open questions to enhance our temporal understanding of fairness, and other open challenges.

Abstract:In the presence of feedback loops, algorithmic decisions at one time step can influence observed data in subsequent steps, potentially introducing selection bias or shifts in data distribution. Research has demonstrated that ignoring these effects can lead to unfairness, which may worsen over time as the model remains deployed within society. This raises important questions of how to measure and ensure fairness of algorithmic decision-making models over time. In this short paper, we present a taxonomy that distinguishes between different types of static and temporal fairness notions in recent advancements. We then suggest prospects for future research by identifying common implicit temporal assumptions, open questions to enhance our temporal understanding of fairness, and other open challenges.

Machine Learning (cs.LG)

arXiv:2610.15015 [cs.LG]

(or arXiv:2610.15015v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.15015 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 210 cuvinte

Subiecte conexe