Pith. sign in

REVIEW 3 cited by

The age of secrecy and unfairness in recidivism prediction

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

arxiv 1811.00731 v2 pith:ZPO5UW54 submitted 2018-11-02 stat.AP cs.CY

classification stat.APcs.CY
keywords algorithmalgorithmscompascriminalfairnessimportantthereargue
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In our current society, secret algorithms make important decisions about individuals. There has been substantial discussion about whether these algorithms are unfair to groups of individuals. While noble, this pursuit is complex and ultimately stagnating because there is no clear definition of fairness and competing definitions are largely incompatible. We argue that the focus on the question of fairness is misplaced, as these algorithms fail to meet a more important and yet readily obtainable goal: transparency. As a result, creators of secret algorithms can provide incomplete or misleading descriptions about how their models work, and various other kinds of errors can easily go unnoticed. By partially reverse engineering the COMPAS algorithm -- a recidivism-risk scoring algorithm used throughout the criminal justice system -- we show that it does not seem to depend linearly on the defendant's age, despite statements to the contrary by the algorithm's creator. Furthermore, by subtracting from COMPAS its (hypothesized) nonlinear age component, we show that COMPAS does not necessarily depend on race, contradicting ProPublica's analysis, which assumed linearity in age. In other words, faulty assumptions about a proprietary algorithm lead to faulty conclusions that go unchecked without careful reverse engineering. Were the algorithm transparent in the first place, this would likely not have occurred. The most important result in this work is that we find that there are many defendants with low risk score but long criminal histories, suggesting that data inconsistencies occur frequently in criminal justice databases. We argue that transparency satisfies a different notion of procedural fairness by providing both the defendants and the public with the opportunity to scrutinize the methodology and calculations behind risk scores for recidivism.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SMOSE: Sparse Mixture of Shallow Experts for Interpretable Reinforcement Learning in Continuous Control Tasks

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A sparse top-1 mixture of linear experts, trained with SAC and distilled into decision trees, matches or beats interpretable baselines and narrows the gap to opaque policies on MuJoCo tasks.

  2. Analyzing Fairness of Computer Vision and Natural Language Processing Models

    cs.LG 2024-12 reject novelty 3.0 of 10

    Chaining fairness mitigation algorithms across ML lifecycle stages sometimes reduces bias more than single-stage application, but the evidence here is under-specified and partly circular.

  3. Analyzing Fairness of Classification Machine Learning Model with Structured Dataset

    cs.LG 2024-12 reject novelty 2.0 of 10

    On the Adult income dataset, fairness libraries Fairlearn, AIF360, and What-If Tool all reduce measured gender disparity in a credit-style classifier, but the paper's comparison across libraries is not controlled.

Pith tools