Why Algorithms Remain Unjust: Power Structures Surrounding Algorithmic Activity

• URL: http://arxiv.org/abs/2405.18461v1
• Date: Tue, 28 May 2024 17:49:24 GMT
• Title: Why Algorithms Remain Unjust: Power Structures Surrounding Algorithmic Activity
• Authors: Andrew Balch,
• Abstract summary: Reformists have failed to curtail algorithmic injustice because they ignore the power structure surrounding algorithms. I argue that the reason Algorithmic Activity is unequal, undemocratic, and unsustainable is that the power structure shaping it is one of economic empowerment rather than social empowerment.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Algorithms play an increasingly-significant role in our social lives. Unfortunately, they often perpetuate social injustices while doing so. The popular means of addressing these algorithmic injustices has been through algorithmic reformism: fine-tuning the algorithm itself to be more fair, accountable, and transparent. While commendable, the emerging discipline of critical algorithm studies shows that reformist approaches have failed to curtail algorithmic injustice because they ignore the power structure surrounding algorithms. Heeding calls from critical algorithm studies to analyze this power structure, I employ a framework developed by Erik Olin Wright to examine the configuration of power surrounding Algorithmic Activity: the ways in which algorithms are researched, developed, trained, and deployed within society. I argue that the reason Algorithmic Activity is unequal, undemocratic, and unsustainable is that the power structure shaping it is one of economic empowerment rather than social empowerment. For Algorithmic Activity to be socially just, we need to transform this power configuration to empower the people at the other end of an algorithm. To this end, I explore Wright's symbiotic, interstitial, and raptural transformations in the context of Algorithmic Activity, as well as how they may be applied in a hypothetical research project that uses algorithms to address a social issue. I conclude with my vision for socially just Algorithmic Activity, asking that future work strives to integrate the proposed transformations and develop new mechanisms for social empowerment.

Related papers

• Towards the Socio-Algorithmic Construction of Fairness: The Case of Automatic Price-Surging in Ride-Hailing [0.0]
  We analyze the public discourse that emerged after a five-fold price-surge following the Brooklyn Subway Shooting. Our results indicate that algorithms, even if not explicitly addressed in the discourse, strongly impact on constructing fairness assessments and notions. We claim that the process of constructing notions of fairness is no longer just social; it has become a socio-algorithmic process.
  arXiv  Detail & Related papers  (2024-08-08T09:11:12Z)
• Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement [65.26723285209853]
  We derive a framework to analyze whether a transparent implementation in a computing model is feasible. Based on previous results, we find that Blum-Shub-Smale Machines have the potential to establish trustworthy solvers for inverse problems.
  arXiv  Detail & Related papers  (2024-01-18T15:32:38Z)
• Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck [55.22418739014892]
  We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al. We apply our algorithm to the quantum information bottleneck with three quantum systems. Our numerical analysis shows that our algorithm is better than their algorithm.
  arXiv  Detail & Related papers  (2023-11-19T00:06:11Z)
• 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)
• Algorithmic neutrality [0.0]
  I investigate algorithmic neutrality, tackling three questions: What is algorithmic neutrality? Is it possible? And when we have it in mind, what can we learn about algorithmic bias?
  arXiv  Detail & Related papers  (2023-03-09T08:23:56Z)
• RMBench: Benchmarking Deep Reinforcement Learning for Robotic Manipulator Control [47.61691569074207]
  Reinforcement learning is applied to solve actual complex tasks from high-dimensional, sensory inputs. Recent progress benefits from deep learning for raw sensory signal representation. We present RMBench, the first benchmark for robotic manipulations.
  arXiv  Detail & Related papers  (2022-10-20T13:34:26Z)
• Reinforcement Learning Algorithms: An Overview and Classification [0.0]
  We identify three main environment types and classify reinforcement learning algorithms according to those environment types. The overview of each algorithm provides insight into the algorithms' foundations and reviews similarities and differences among algorithms.
  arXiv  Detail & Related papers  (2022-09-29T16:58:42Z)
• Tree-Based Adaptive Model Learning [62.997667081978825]
  We extend the Kearns-Vazirani learning algorithm to handle systems that change over time. We present a new learning algorithm that can reuse and update previously learned behavior, implement it in the LearnLib library, and evaluate it on large examples.
  arXiv  Detail & Related papers  (2022-08-31T21:24:22Z)
• The Algorithmic Imprint [15.273400795479223]
  We introduce the notion of the "algorithmic imprint" to illustrate how merely removing an algorithm does not necessarily undo or mitigate its consequences. We show how the removal failed to undo the algorithmic imprint on the sociotechnical infrastructures that shape students', teachers', and parents' lives. We situate our case study in Bangladesh to illustrate how algorithms made in the Global North disproportionately impact stakeholders in the Global South.
  arXiv  Detail & Related papers  (2022-06-03T15:44:44Z)
• An Approach for Automatic Construction of an Algorithmic Knowledge Graph from Textual Resources [3.723553383515688]
  We introduce an approach for automatically developing a knowledge graph for algorithmic problems from unstructured data. An algorithm KG will give additional context and explainability to the algorithm metadata.
  arXiv  Detail & Related papers  (2022-05-13T18:59:23Z)
• How to transfer algorithmic reasoning knowledge to learn new algorithms? [23.335939830754747]
  We investigate how we can use algorithms for which we have access to the execution trace to learn to solve similar tasks for which we do not. We create a dataset including 9 algorithms and 3 different graph types. We validate this empirically and show how instead multi-task learning can be used to achieve the transfer of algorithmic reasoning knowledge.
  arXiv  Detail & Related papers  (2021-10-26T22:14:47Z)
• Deep Algorithm Unrolling for Biomedical Imaging [99.73317152134028]
  In this chapter, we review biomedical applications and breakthroughs via leveraging algorithm unrolling. We trace the origin of algorithm unrolling and provide a comprehensive tutorial on how to unroll iterative algorithms into deep networks. We conclude the chapter by discussing open challenges, and suggesting future research directions.
  arXiv  Detail & Related papers  (2021-08-15T01:06:26Z)
• Beyond Algorithmic Bias: A Socio-Computational Interrogation of the Google Search by Image Algorithm [0.799536002595393]
  We audit the algorithm by presenting it with more than 40 thousands faces of all ages and more than four races. We find that the algorithm reproduces white male patriarchal structures, often simplifying, stereotyping and discriminating females and non-white individuals.
  arXiv  Detail & Related papers  (2021-05-26T21:40:43Z)
• Evolving Reinforcement Learning Algorithms [186.62294652057062]
  We propose a method for meta-learning reinforcement learning algorithms. The learned algorithms are domain-agnostic and can generalize to new environments not seen during training. We highlight two learned algorithms which obtain good generalization performance over other classical control tasks, gridworld type tasks, and Atari games.
  arXiv  Detail & Related papers  (2021-01-08T18:55:07Z)
• Towards Meta-Algorithm Selection [78.13985819417974]
  Instance-specific algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidates. We show that meta-algorithm-selection can indeed prove beneficial in some cases.
  arXiv  Detail & Related papers  (2020-11-17T17:27:33Z)
• Mastering Rate based Curriculum Learning [78.45222238426246]
  We argue that the notion of learning progress itself has several shortcomings that lead to a low sample efficiency for the learner. We propose a new algorithm, based on the notion of mastering rate, that significantly outperforms learning progress-based algorithms.
  arXiv  Detail & Related papers  (2020-08-14T16:34:01Z)
• A Brief Look at Generalization in Visual Meta-Reinforcement Learning [56.50123642237106]
  We evaluate the generalization performance of meta-reinforcement learning algorithms. We find that these algorithms can display strong overfitting when they are evaluated on challenging tasks.
  arXiv  Detail & Related papers  (2020-06-12T15:17:17Z)

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.