Algorithms, Incentives, and Democracy

• URL: http://arxiv.org/abs/2307.02319v1
• Date: Wed, 5 Jul 2023 14:22:01 GMT
• Title: Algorithms, Incentives, and Democracy
• Authors: Elizabeth Maggie Penn and John W. Patty
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Classification algorithms are increasingly used in areas such as housing, credit, and law enforcement in order to make decisions affecting peoples' lives. These algorithms can change individual behavior deliberately (a fraud prediction algorithm deterring fraud) or inadvertently (content sorting algorithms spreading misinformation), and they are increasingly facing public scrutiny and regulation. Some of these regulations, like the elimination of cash bail in some states, have focused on \textit{lowering the stakes of certain classifications}. In this paper we characterize how optimal classification by an algorithm designer can affect the distribution of behavior in a population -- sometimes in surprising ways. We then look at the effect of democratizing the rewards and punishments, or stakes, to algorithmic classification to consider how a society can potentially stem (or facilitate!) predatory classification. Our results speak to questions of algorithmic fairness in settings where behavior and algorithms are interdependent, and where typical measures of fairness focusing on statistical accuracy across groups may not be appropriate.

Related papers

• A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent [57.64826450787237]
  We show how to analyze the behavior of distributed gradient descent algorithms in the presence of adversarial corruptions. We show how to use ideas from (lazy) mirror descent to design a corruption-tolerant distributed optimization algorithm. Experiments based on linear regression, support vector classification, and softmax classification on the MNIST dataset corroborate our theoretical findings.
  arXiv  Detail & Related papers  (2024-07-19T08:29:12Z)
• Bipartite Ranking Fairness through a Model Agnostic Ordering Adjustment [54.179859639868646]
  We propose a model agnostic post-processing framework xOrder for achieving fairness in bipartite ranking. xOrder is compatible with various classification models and ranking fairness metrics, including supervised and unsupervised fairness metrics. We evaluate our proposed algorithm on four benchmark data sets and two real-world patient electronic health record repositories.
  arXiv  Detail & Related papers  (2023-07-27T07:42:44Z)
• 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)
• Discrimination in machine learning algorithms [0.0]
  Machine learning algorithms are routinely used for business decisions that may directly affect individuals, for example, because a credit scoring algorithm refuses them a loan. It is then relevant from an ethical (and legal) point of view to ensure that these algorithms do not discriminate based on sensitive attributes (like sex or race), which may occur unwittingly and unknowingly by the operator and the management.
  arXiv  Detail & Related papers  (2022-06-30T21:35:42Z)
• 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)
• Selective Credit Assignment [57.41789233550586]
  We describe a unified view on temporal-difference algorithms for selective credit assignment. We present insights into applying weightings to value-based learning and planning algorithms.
  arXiv  Detail & Related papers  (2022-02-20T00:07:57Z)
• 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)
• 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)
• When Fair Ranking Meets Uncertain Inference [5.33312437416961]
  We show how demographic inferences drawn from real systems can lead to unfair rankings. Our results suggest developers should not use inferred demographic data as input to fair ranking algorithms.
  arXiv  Detail & Related papers  (2021-05-05T14:40:07Z)
• Pursuing Open-Source Development of Predictive Algorithms: The Case of Criminal Sentencing Algorithms [0.0]
  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.
  arXiv  Detail & Related papers  (2020-11-12T14:53:43Z)
• Optimal Clustering from Noisy Binary Feedback [75.17453757892152]
  We study the problem of clustering a set of items from binary user feedback. We devise an algorithm with a minimal cluster recovery error rate. For adaptive selection, we develop an algorithm inspired by the derivation of the information-theoretical error lower bounds.
  arXiv  Detail & Related papers  (2019-10-14T09:18:26Z)

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.