The Role of Learning Algorithms in Collective Action
Omri Ben-Dov, Jake Fawkes, Samira Samadi, Amartya Sanyal
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d62895ac-2d72-424b-8eec-d750917e7c9bCited by top-tier papers3
- Look-Ahead Reasoning on Learning PlatformsHaiqing Zhu, Tijana Zrnic, Celestine Mendler-DünnerNeurIPS 2025 · 5 citations
- Optimal Regularization for Performative LearningEdwige Cyffers, Alireza Mirrokni, Marco MondelliICML 2026 · 1 citation
- Statistical Collusion by Collectives on Learning PlatformsEtienne Gauthier, Francis Bach, Michael I. JordanICML 2025
Builds on15
- Direct Preference Optimization: Your Language Model is Secretly a Reward ModelRafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D. Manning et al.NeurIPS 2023 · 10,924 citations
- WILDS: A Benchmark of in-the-Wild Distribution ShiftsPang Wei Koh, Shiori Sagawa, Henrik Marklund, Sang Michael Xie et al.ICML 2021 · 1,773 citations
- Distributionally Robust Neural NetworksShiori Sagawa, Pang Wei Koh, Tatsunori B. Hashimoto, Percy LiangICLR 2020 · 1,578 citations
- Just Train Twice: Improving Group Robustness without Training Group InformationEvan Zheran Liu, Behzad Haghgoo, Annie S. Chen, Aditi Raghunathan et al.ICML 2021 · 683 citations
- The Pitfalls of Simplicity Bias in Neural NetworksHarshay Shah, Kaustav Tamuly, Aditi Raghunathan, Prateek Jain et al.NeurIPS 2020 · 503 citations
Related papers
- Efficient Generalization with Distributionally Robust LearningSoumyadip Ghosh, Mark S. Squillante, Ebisa D. WollegaNeurIPS 2021 · 4 citations
- Algorithmic Collective Action in Machine LearningMoritz Hardt, Eric Mazumdar, Celestine Mendler-Dünner, Tijana ZrnicICML 2023 · 36 citations
- Stochastic Approximation Approaches to Group Distributionally Robust OptimizationLijun Zhang, Peng Zhao, Zhen-Hua Zhuang, Tianbao Yang et al.NeurIPS 2023 · 24 citations
- Distributionally Robust Optimization with Probabilistic GroupSoumya Suvra Ghosal, Yixuan LiAAAI 2023 · 14 citations
- Re-weighting Based Group Fairness Regularization via Classwise Robust OptimizationSangwon Jung, Taeeon Park, Sanghyuk Chun, Taesup MoonICLR 2023 · 5 citations
