Pursuing Open-Source Development of Predictive Algorithms: The Case of Criminal Sentencing Algorithms

• URL: http://arxiv.org/abs/2011.06422v1
• Date: Thu, 12 Nov 2020 14:53:43 GMT
• Title: Pursuing Open-Source Development of Predictive Algorithms: The Case of Criminal Sentencing Algorithms
• Authors: Philip D. Waggoner, Alec Macmillen
• Abstract summary: We argue that open-source algorithm development should be the standard in highly consequential contexts. We suggest these issues are exacerbated by the proprietary and expensive nature of virtually all widely used criminal sentencing algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Currently, there is uncertainty surrounding the merits of open-source versus proprietary algorithm development. Though justification in favor of each exists, we argue that open-source algorithm development should be the standard in highly consequential contexts that affect people's lives for reasons of transparency and collaboration, which contribute to greater predictive accuracy and enjoy the additional advantage of cost-effectiveness. To make this case, we focus on criminal sentencing algorithms, as criminal sentencing is highly consequential, and impacts society and individual people. Further, the popularity of this topic has surged in the wake of recent studies uncovering racial bias in proprietary sentencing algorithms among other issues of over-fitting and model complexity. We suggest these issues are exacerbated by the proprietary and expensive nature of virtually all widely used criminal sentencing algorithms. Upon replicating a major algorithm using real criminal profiles, we fit three penalized regressions and demonstrate an increase in predictive power of these open-source and relatively computationally inexpensive options. The result is a data-driven suggestion that if judges who are making sentencing decisions want to craft appropriate sentences based on a high degree of accuracy and at low costs, then they should be pursuing open-source options.

Related papers

• Algorithms, Incentives, and Democracy [0.0]
  We show how optimal classification by an algorithm designer can affect the distribution of behavior in a population. We then look at the effect of democratizing the rewards and punishments, or stakes, to the algorithmic classification to consider how a society can potentially stem (or facilitate!) predatory classification.
  arXiv  Detail & Related papers  (2023-07-05T14:22:01Z)
• A Gold Standard Dataset for the Reviewer Assignment Problem [117.59690218507565]
  "Similarity score" is a numerical estimate of the expertise of a reviewer in reviewing a paper. Our dataset consists of 477 self-reported expertise scores provided by 58 researchers. For the task of ordering two papers in terms of their relevance for a reviewer, the error rates range from 12%-30% in easy cases to 36%-43% in hard cases.
  arXiv  Detail & Related papers  (2023-03-23T16:15:03Z)
• Designing Equitable Algorithms [1.9006392177894293]
  Predictive algorithms are now used to help distribute a large share of our society's resources and sanctions. These algorithms can improve the efficiency and equity of decision-making. But they could entrench and exacerbate disparities, particularly along racial, ethnic, and gender lines.
  arXiv  Detail & Related papers  (2023-02-17T22:00:44Z)
• Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes [59.61248760134937]
  We propose an efficient algorithm to achieve a regret of $tildeO(sqrtT+zeta)$. The proposed algorithm relies on the recently developed uncertainty-weighted least-squares regression from linear contextual bandit. We generalize our algorithm to the episodic MDP setting and first achieve an additive dependence on the corruption level $zeta$.
  arXiv  Detail & Related papers  (2022-12-12T15:04:56Z)
• Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions [98.75618795470524]
  We study the linear contextual bandit problem in the presence of adversarial corruption. We propose a new algorithm based on the principle of optimism in the face of uncertainty.
  arXiv  Detail & Related papers  (2022-05-13T17:58:58Z)
• Analyzing a Carceral Algorithm used by the Pennsylvania Department of Corrections [0.0]
  This paper is focused on the Pennsylvania Additive Classification Tool (PACT) used to classify prisoners' custody levels while they are incarcerated. The algorithm in this case determines the likelihood a person would endure additional disciplinary actions, can complete required programming, and gain experiences that, among other things, are distilled into variables feeding into the parole algorithm.
  arXiv  Detail & Related papers  (2021-12-06T18:47:31Z)
• Uncertainty in Criminal Justice Algorithms: simulation studies of the Pennsylvania Additive Classification Tool [0.0]
  We study the Pennsylvania Additive Classification Tool (PACT) that assigns custody levels to incarcerated individuals. We analyze the PACT in ways that criminal justice algorithms are often analyzed. We propose and carry out some new ways to study such algorithms.
  arXiv  Detail & Related papers  (2021-12-01T06:27:24Z)
• Learning to be Fair: A Consequentialist Approach to Equitable Decision-Making [21.152377319502705]
  We present an alternative framework for designing equitable algorithms. In our approach, one first elicits stakeholder preferences over the space of possible decisions. We then optimize over the space of decision policies, making trade-offs in a way that maximizes the elicited utility.
  arXiv  Detail & Related papers  (2021-09-18T00:30:43Z)
• 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)
• Double Coverage with Machine-Learned Advice [100.23487145400833]
  We study the fundamental online $k$-server problem in a learning-augmented setting. We show that our algorithm achieves for any k an almost optimal consistency-robustness tradeoff.
  arXiv  Detail & Related papers  (2021-03-02T11:04:33Z)
• Greedy Algorithm almost Dominates in Smoothed Contextual Bandits [100.09904315064372]
  Online learning algorithms must balance exploration and exploitation. We show that a greedy approach almost matches the best possible Bayesian regret rate of any other algorithm.
  arXiv  Detail & Related papers  (2020-05-19T18:11:40Z)

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.