Joshua Andrews

dblp:294/1425 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-7087-5641ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
multi-objective optimization
0.512021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Machine learning › Trustworthy machine learning
fairness
0.112021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Computational social science and digital humanities
algorithmic decision-making
0.112021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021
Computational social science and digital humanities › algorithmic decision-making
algorithmic hiring
0.112021
Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization · AAAI 2021

Methods — techniques the papers use, named apart from their topics

dirichlet-based genetic operators · 1.5bi-goal evolution · 1.5SPEA2-SDE · 1.5NSGA-III · 1.5
YearPublicationVenuePosition
2021 Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization
abstract
Hiring is a high-stakes decision-making process that balances the joint objectives of being fair and accurately selecting the top candidates. The industry standard method employs subject-matter experts to manually generate hiring algorithms; however, this method is resource intensive and finds sub-optimal solutions. Despite the recognized need for algorithmic hiring solutions to address these limitations, no reported method currently supports optimizing predictive objectives while complying to legal fairness standards. We present the novel application of Evolutionary Many-Objective Optimization (EMOO) methods to create the first fair, interpretable, and legally compliant algorithmic hiring approach. Using a proposed novel application of Dirichlet-based genetic operators for improved search, we compare state-of-the-art EMOO models (NSGA-III, SPEA2-SDE, bi-goal evolution) to expert solutions, verifying our results across three real world datasets across diverse organizational positions. Experimental results demonstrate the proposed EMOO models outperform human experts, consistently generate fairer hiring algorithms, and can provide additional lift when removing constraints required for human analysis.
Michael Geden, Joshua Andrews
AAAI2