Reducing Discrimination in Learning Algorithms for Social Good in Sociotechnical Systems

• URL: http://arxiv.org/abs/2011.13988v2
• Date: Sun, 6 Dec 2020 05:10:08 GMT
• Title: Reducing Discrimination in Learning Algorithms for Social Good in Sociotechnical Systems
• Authors: Katelyn Morrison
• Abstract summary: I will address how smart mobility initiatives in cities use machine learning algorithms to address challenges. I will also address how these algorithms unintentionally discriminate against features such as socioeconomic status to motivate the importance of algorithmic fairness.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sociotechnical systems within cities are now equipped with machine learning algorithms in hopes to increase efficiency and functionality by modeling and predicting trends. Machine learning algorithms have been applied in these domains to address challenges such as balancing the distribution of bikes throughout a city and identifying demand hotspots for ride sharing drivers. However, these algorithms applied to challenges in sociotechnical systems have exacerbated social inequalities due to previous bias in data sets or the lack of data from marginalized communities. In this paper, I will address how smart mobility initiatives in cities use machine learning algorithms to address challenges. I will also address how these algorithms unintentionally discriminate against features such as socioeconomic status to motivate the importance of algorithmic fairness. Using the bike sharing program in Pittsburgh, PA, I will present a position on how discrimination can be eliminated from the pipeline using Bayesian Optimization.

Related papers

• Robo-taxi Fleet Coordination at Scale via Reinforcement Learning [21.266509380044912]
  This work introduces a novel decision-making framework that unites mathematical modeling with data-driven techniques. We present the AMoD coordination problem through the lens of reinforcement learning and propose a graph network-based framework. In particular, we present the AMoD coordination problem through the lens of reinforcement learning and propose a graph network-based framework.
  arXiv  Detail & Related papers  (2025-04-08T15:19:41Z)
• Learning Multi-Robot Coordination through Locality-Based Factorized Multi-Agent Actor-Critic Algorithm [54.98788921815576]
  We present a novel cooperative multi-agent reinforcement learning method called textbfLocality based textbfFactorized textbfMulti-Agent textbfActor-textbfCritic (Loc-FACMAC) We integrate the concept of locality into critic learning, where strongly related robots form partitions during training. Our method improves existing algorithms by focusing on local rewards and leveraging partition-based learning to enhance training efficiency and performance.
  arXiv  Detail & Related papers  (2025-03-24T16:00:16Z)
• Long-Term Fairness with Unknown Dynamics [16.683582656377396]
  We formalize long-term fairness in the context of online reinforcement learning. We show that an algorithm can adapt to unknown dynamics by sacrificing short-term incentives.
  arXiv  Detail & Related papers  (2023-04-19T01:13:37Z)
• 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)
• Stochastic Differentially Private and Fair Learning [7.971065005161566]
  We provide the first differentially private algorithm for fair learning that is guaranteed to converge. Our framework is flexible enough to permit different fairness, including demographic parity and equalized odds. Our algorithm can be applied to non-binary classification tasks with multiple (non-binary) sensitive attributes.
  arXiv  Detail & Related papers  (2022-10-17T06:54:57Z)
• 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)
• Cooperative Behavioral Planning for Automated Driving using Graph Neural Networks [0.5801044612920815]
  This work proposes to leverage machine learning algorithms to optimize traffic flow at urban intersections by jointly planning for multiple vehicles. Learning-based behavior planning poses several challenges, demanding for a suited input and output representation as well as large amounts of ground-truth data. We train and evaluate the proposed method in an open-source simulation environment for decision making in automated driving.
  arXiv  Detail & Related papers  (2022-02-23T09:36:15Z)
• Learning from Heterogeneous Data Based on Social Interactions over Graphs [58.34060409467834]
  This work proposes a decentralized architecture, where individual agents aim at solving a classification problem while observing streaming features of different dimensions. We show that the. strategy enables the agents to learn consistently under this highly-heterogeneous setting. We show that the. strategy enables the agents to learn consistently under this highly-heterogeneous setting.
  arXiv  Detail & Related papers  (2021-12-17T12:47:18Z)
• MURAL: Meta-Learning Uncertainty-Aware Rewards for Outcome-Driven Reinforcement Learning [65.52675802289775]
  We show that an uncertainty aware classifier can solve challenging reinforcement learning problems. We propose a novel method for computing the normalized maximum likelihood (NML) distribution. We show that the resulting algorithm has a number of intriguing connections to both count-based exploration methods and prior algorithms for learning reward functions.
  arXiv  Detail & Related papers  (2021-07-15T08:19:57Z)
• Fair Representation Learning for Heterogeneous Information Networks [35.80367469624887]
  We propose a comprehensive set of de-biasing methods for fair HINs representation learning. We study the behavior of these algorithms, especially their capability in balancing the trade-off between fairness and prediction accuracy. We evaluate the performance of the proposed methods in an automated career counseling application.
  arXiv  Detail & Related papers  (2021-04-18T08:28:18Z)
• GAEA: Graph Augmentation for Equitable Access via Reinforcement Learning [50.90625274621288]
  Disparate access to resources by different subpopulations is a prevalent issue in societal and sociotechnical networks. We introduce a new class of problems, Graph Augmentation for Equitable Access (GAEA), to enhance equity in networked systems by editing graph edges under budget constraints.
  arXiv  Detail & Related papers  (2020-12-07T18:29:32Z)
• Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms [85.97516436641533]
  We study the problem of improving the performance of online algorithms by incorporating machine-learned predictions. The goal is to design algorithms that are both consistent and robust. We provide the first set of non-trivial lower bounds for competitive analysis using machine-learned predictions.
  arXiv  Detail & Related papers  (2020-10-22T04:51:01Z)
• 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)

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.