Timezone: »
We initiate a principled study of algorithmic collective action on digital platforms that deploy machine learning algorithms. We propose a simple theoretical model of a collective interacting with a firm's learning algorithm. The collective pools the data of participating individuals and executes an algorithmic strategy by instructing participants how to modify their own data to achieve a collective goal. We investigate the consequences of this model in three fundamental learning-theoretic settings: nonparametric optimal learning, parametric risk minimization, and gradient-based optimization. In each setting, we come up with coordinated algorithmic strategies and characterize natural success criteria as a function of the collective's size. Complementing our theory, we conduct systematic experiments on a skill classification task involving tens of thousands of resumes from a gig platform for freelancers. Through more than two thousand model training runs of a BERT-like language model, we see a striking correspondence emerge between our empirical observations and the predictions made by our theory. Taken together, our theory and experiments broadly support the conclusion that algorithmic collectives of exceedingly small fractional size can exert significant control over a platform's learning algorithm.
Author Information
Moritz Hardt (Max-Planck-Institute for Intelligent Systems, Max-Planck Institute)
Eric Mazumdar (Caltech)
Celestine Mendler-Dünner (Max Planck Institute for Intelligent Systems)
Tijana Zrnic (Stanford University)
More from the Same Authors
-
2023 : Coupled Gradient Flows for Strategic Non-Local Distribution Shift »
Lauren Conger · Franca Hoffmann · Eric Mazumdar · Lillian Ratliff -
2022 Poster: Regret Minimization with Performative Feedback »
Meena Jagadeesan · Tijana Zrnic · Celestine Mendler-Dünner -
2022 Spotlight: Regret Minimization with Performative Feedback »
Meena Jagadeesan · Tijana Zrnic · Celestine Mendler-Dünner -
2022 Poster: Langevin Monte Carlo for Contextual Bandits »
Pan Xu · Hongkai Zheng · Eric Mazumdar · Kamyar Azizzadenesheli · Animashree Anandkumar -
2022 Spotlight: Langevin Monte Carlo for Contextual Bandits »
Pan Xu · Hongkai Zheng · Eric Mazumdar · Kamyar Azizzadenesheli · Animashree Anandkumar -
2022 : Invited Talk: Celestine Mendler-Dunner »
Celestine Mendler-Dünner -
2021 Poster: Outside the Echo Chamber: Optimizing the Performative Risk »
John Miller · Juan Perdomo · Tijana Zrnic -
2021 Poster: Alternative Microfoundations for Strategic Classification »
Meena Jagadeesan · Celestine Mendler-Dünner · Moritz Hardt -
2021 Spotlight: Outside the Echo Chamber: Optimizing the Performative Risk »
John Miller · Juan Perdomo · Tijana Zrnic -
2021 Spotlight: Alternative Microfoundations for Strategic Classification »
Meena Jagadeesan · Celestine Mendler-Dünner · Moritz Hardt -
2020 Poster: Randomized Block-Diagonal Preconditioning for Parallel Learning »
Celestine Mendler-Dünner · Aurelien Lucchi -
2020 Poster: Performative Prediction »
Juan Perdomo · Tijana Zrnic · Celestine Mendler-Dünner · Moritz Hardt -
2019 Poster: Natural Analysts in Adaptive Data Analysis »
Tijana Zrnic · Moritz Hardt -
2019 Oral: Natural Analysts in Adaptive Data Analysis »
Tijana Zrnic · Moritz Hardt -
2018 Poster: SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate »
Aaditya Ramdas · Tijana Zrnic · Martin Wainwright · Michael Jordan -
2018 Oral: SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate »
Aaditya Ramdas · Tijana Zrnic · Martin Wainwright · Michael Jordan