A Framework of High-Stakes Algorithmic Decision-Making for the Public
Sector Developed through a Case Study of Child-Welfare
- URL: http://arxiv.org/abs/2107.03487v3
- Date: Tue, 12 Oct 2021 13:47:21 GMT
- Title: A Framework of High-Stakes Algorithmic Decision-Making for the Public
Sector Developed through a Case Study of Child-Welfare
- Authors: Devansh Saxena, Karla Badillo-Urquiola, Pamela Wisniewski, Shion Guha
- Abstract summary: We develop a cohesive framework of algorithmic decision-making adapted for the public sector.
We conduct a case study of the algorithms in daily use within a child-welfare agency.
We propose guidelines for the design of high-stakes algorithmic decision-making tools in the public sector.
- Score: 3.739243122393041
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Algorithms have permeated throughout civil government and society, where they
are being used to make high-stakes decisions about human lives. In this paper,
we first develop a cohesive framework of algorithmic decision-making adapted
for the public sector (ADMAPS) that reflects the complex socio-technical
interactions between \textit{human discretion}, \textit{bureaucratic
processes}, and \textit{algorithmic decision-making} by synthesizing disparate
bodies of work in the fields of Human-Computer Interaction (HCI), Science and
Technology Studies (STS), and Public Administration (PA). We then applied the
ADMAPS framework to conduct a qualitative analysis of an in-depth, eight-month
ethnographic case study of the algorithms in daily use within a child-welfare
agency that serves approximately 900 families and 1300 children in the
mid-western United States. Overall, we found there is a need to focus on
strength-based algorithmic outcomes centered in social ecological frameworks.
In addition, algorithmic systems need to support existing bureaucratic
processes and augment human discretion, rather than replace it. Finally,
collective buy-in in algorithmic systems requires trust in the target outcomes
at both the practitioner and bureaucratic levels. As a result of our study, we
propose guidelines for the design of high-stakes algorithmic decision-making
tools in the child-welfare system, and more generally, in the public sector. We
empirically validate the theoretically derived ADMAPS framework to demonstrate
how it can be useful for systematically making pragmatic decisions about the
design of algorithms for the public sector.
Related papers
- A Unifying Post-Processing Framework for Multi-Objective Learn-to-Defer Problems [6.046591474843391]
Learn-to-Defer is a paradigm that enables learning algorithms to work not in isolation but as a team with human experts.
In this paper, we obtain the Bayes optimal solution for learn-to-defer systems under various constraints.
Our algorithm shows improvements in terms of constraint violation over a set of baselines.
arXiv Detail & Related papers (2024-07-17T16:32:30Z) - Algorithms as Social-Ecological-Technological Systems: an Environmental
Justice Lens on Algorithmic Audits [0.5076419064097732]
This paper reframes algorithmic systems as intimately connected to and part of social and ecological systems.
We propose a first-of-its-kind methodology for environmental justice-oriented algorithmic audits.
arXiv Detail & Related papers (2023-05-09T19:25:25Z) - Human-Centric Multimodal Machine Learning: Recent Advances and Testbed
on AI-based Recruitment [66.91538273487379]
There is a certain consensus about the need to develop AI applications with a Human-Centric approach.
Human-Centric Machine Learning needs to be developed based on four main requirements: (i) utility and social good; (ii) privacy and data ownership; (iii) transparency and accountability; and (iv) fairness in AI-driven decision-making processes.
We study how current multimodal algorithms based on heterogeneous sources of information are affected by sensitive elements and inner biases in the data.
arXiv Detail & Related papers (2023-02-13T16:44:44Z) - Machine Learning for Online Algorithm Selection under Censored Feedback [71.6879432974126]
In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms.
For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime.
In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem.
We adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon.
arXiv Detail & Related papers (2021-09-13T18:10:52Z) - Fairness Perceptions of Algorithmic Decision-Making: A Systematic Review
of the Empirical Literature [0.0]
Algorithmic decision-making (ADM) increasingly shapes people's daily lives.
A human-centric approach demanded by scholars and policymakers requires taking people's fairness perceptions into account.
We provide a comprehensive, systematic literature review of the existing empirical insights on perceptions of algorithmic fairness.
arXiv Detail & Related papers (2021-03-22T17:12:45Z) - A black-box adversarial attack for poisoning clustering [78.19784577498031]
We propose a black-box adversarial attack for crafting adversarial samples to test the robustness of clustering algorithms.
We show that our attacks are transferable even against supervised algorithms such as SVMs, random forests, and neural networks.
arXiv Detail & Related papers (2020-09-09T18:19:31Z) - Run2Survive: A Decision-theoretic Approach to Algorithm Selection based
on Survival Analysis [75.64261155172856]
survival analysis (SA) naturally supports censored data and offers appropriate ways to use such data for learning distributional models of algorithm runtime.
We leverage such models as a basis of a sophisticated decision-theoretic approach to algorithm selection, which we dub Run2Survive.
In an extensive experimental study with the standard benchmark ASlib, our approach is shown to be highly competitive and in many cases even superior to state-of-the-art AS approaches.
arXiv Detail & Related papers (2020-07-06T15:20:17Z) - Bias in Multimodal AI: Testbed for Fair Automatic Recruitment [73.85525896663371]
We study how current multimodal algorithms based on heterogeneous sources of information are affected by sensitive elements and inner biases in the data.
We train automatic recruitment algorithms using a set of multimodal synthetic profiles consciously scored with gender and racial biases.
Our methodology and results show how to generate fairer AI-based tools in general, and in particular fairer automated recruitment systems.
arXiv Detail & Related papers (2020-04-15T15:58:05Z) - A Human-Centered Review of the Algorithms used within the U.S. Child
Welfare System [17.161947795238916]
U.S. Child Welfare System (CWS) is charged with improving outcomes for foster youth; yet, they are overburdened and underfunded.
Several states have turned towards algorithmic decision-making systems to reduce costs and determine better processes for improving CWS outcomes.
We synthesize 50 peer-reviewed publications on computational systems used in CWS to assess how they were being developed, common characteristics of predictors used, as well as the target outcomes.
arXiv Detail & Related papers (2020-03-07T09:16:12Z) - Extreme Algorithm Selection With Dyadic Feature Representation [78.13985819417974]
We propose the setting of extreme algorithm selection (XAS) where we consider fixed sets of thousands of candidate algorithms.
We assess the applicability of state-of-the-art AS techniques to the XAS setting and propose approaches leveraging a dyadic feature representation.
arXiv Detail & Related papers (2020-01-29T09:40:58Z) - Algorithmic Fairness [11.650381752104298]
It is crucial to develop AI algorithms that are not only accurate but also objective and fair.
Recent studies have shown that algorithmic decision-making may be inherently prone to unfairness.
arXiv Detail & Related papers (2020-01-21T19:01:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.