Rank sets from locally perturbed scores reveal that deterministic AI candidate rankings in hiring are often indistinguishable, and expected-rank rankings track known true rankings better under noise.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Humble AI in the real-world: the case of algorithmic hiring
Rank sets from locally perturbed scores reveal that deterministic AI candidate rankings in hiring are often indistinguishable, and expected-rank rankings track known true rankings better under noise.