REVIEW 2 cited by
Fairness in Algorithmic Profiling: A German Case Study
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Algorithmic profiling is increasingly used in the public sector as a means to allocate limited public resources effectively and objectively. One example is the prediction-based statistical profiling of job seekers to guide the allocation of support measures by public employment services. However, empirical evaluations of potential side-effects such as unintended discrimination and fairness concerns are rare. In this study, we compare and evaluate statistical models for predicting job seekers' risk of becoming long-term unemployed with respect to prediction performance, fairness metrics, and vulnerabilities to data analysis decisions. Focusing on Germany as a use case, we evaluate profiling models under realistic conditions by utilizing administrative data on job seekers' employment histories that are routinely collected by German public employment services. Besides showing that these data can be used to predict long-term unemployment with competitive levels of accuracy, we highlight that different classification policies have very different fairness implications. We therefore call for rigorous auditing processes before such models are put to practice.
Forward citations
Cited by 2 Pith papers
-
Performative Learning Theory
For performative predictions, finite-sample generalization bounds are proven whose key term grows with the fraction of data the model changes, formalizing a change-vs-learn trade-off.
-
Transparent and Fair Profiling in Employment Services: Evidence from Switzerland
On Swiss employment data, explainable boosting machines predict long-term unemployment almost as accurately as XGBoost while remaining fully interpretable.
Discussion (0). Continue with ORCID to comment.