mlsanityData to 13 Oct 2026

The Role of Learning Algorithms in Collective Action

arXiv 2405.06582 ↗First posted 10 May 2024cs.LG cs.CY stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Collective action in machine learning is the study of the control that a coordinated group can have over machine learning algorithms. While previous research has concentrated on assessing the impact of collectives against Bayes (sub-)optimal classifiers, this perspective is limited in that it does not account for the choice of learning algorithm. Since classifiers seldom behave like Bayes classifiers and are influenced by the choice of learning algorithms along with their inherent biases, in this work we initiate the study of how the choice of the learning algorithm plays a role in the success of a collective in practical settings. Specifically, we focus on distributionally robust optimization (DRO), popular for improving a worst group error, and on the ubiquitous stochastic gradient descent (SGD), due to its inductive bias for "simpler" functions. Our empirical results, supported by a theoretical foundation, show that the effective size and success of the collective are highly dependent on properties of the learning algorithm. This highlights the necessity of taking the learning algorithm into account when studying the impact of collective action in machine learning.

Key facts. Cited by 8 papers in the map (data through 13 Oct 2026). Builds on 24 of its 41 references that are in the map. First posted on arXiv 10 May 2024.

Builds on

24 of 41 references.

References · 24

  1. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,986
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,379
  3. 2017Deep reinforcement learning from human preferencescited by 3,871
  4. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,862
  5. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,371
  6. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
  7. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
  8. 2020The Pitfalls of Simplicity Bias in Neural Networkscited by 351
  9. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  10. 2019Differential Privacy Has Disparate Impact on Model Accuracycited by 316
  11. 2019SGD on Neural Networks Learns Functions of Increasing Complexitycited by 204
  12. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
12 more
  1. 2016Variance-based regularization with convex objectivescited by 153
  2. 2017A Convex Framework for Fair Regressioncited by 148
  3. 2020Robust Optimization for Fairness with Noisy Protected Groupscited by 78
  4. 2022Adversarial Training for High-Stakes Reliabilitycited by 60
  5. 2021Examining the Inductive Bias of Neural Language Models with Artificial Languagescited by 40
  6. 2019Toward a better trade-off between performance and fairness with kernel-based distribution matchingcited by 36
  7. 2021The Inductive Bias of In-Context Learning: Rethinking Pretraining Example Designcited by 33
  8. 2014Maximin effects in inhomogeneous large-scale datacited by 32
  9. 2023Algorithmic Collective Action in Machine Learningcited by 31
  10. 2022How Robust is Unsupervised Representation Learning to Distribution Shift?cited by 24
  11. 2022How unfair is private learning ?cited by 18
  12. 2022A law of adversarial risk, interpolation, and label noisecited by 8

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 1.

8 papers.