mlsanityData to 7 Oct 2026

Understanding Model Selection For Learning In Strategic Environments

arXiv 2402.07588 ↗First posted 12 Feb 2024cs.GT cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

The deployment of ever-larger machine learning models reflects a growing consensus that the more expressive the model class one optimizes overunicodex2013and the more data one has access tounicodex2013the more one can improve performance. As models get deployed in a variety of real-world scenarios, they inevitably face strategic environments. In this work, we consider the natural question of how the interplay of models and strategic interactions affects the relationship between performance at equilibrium and the expressivity of model classes. We find that strategic interactions can break the conventional viewunicodex2013meaning that performance does not necessarily monotonically improve as model classes get larger or more expressive (even with infinite data). We show the implications of this result in several contexts including strategic regression, strategic classification, and multi-agent reinforcement learning. In particular, we show that each of these settings admits a Braess' paradox-like phenomenon in which optimizing over less expressive model classes allows one to achieve strictly better equilibrium outcomes. Motivated by these examples, we then propose a new paradigm for model selection in games wherein an agent seeks to choose amongst different model classes to use as their action set in a game.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 49 references that are in the map. First posted on arXiv 12 Feb 2024.

Builds on

21 of 49 references.

References · 21

  1. 2020Scaling Laws for Neural Language Modelscited by 6,411
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
  6. 2021Explaining Neural Scaling Lawscited by 353
  7. 2020Performative Predictioncited by 318
  8. 2015Strategic Classificationcited by 256
  9. 2018Manipulating Machine Learning: Poisoning Attacks and Countermeasures for Regression Learningcited by 219
  10. 2017Strategic Classification from Revealed Preferencescited by 126
  11. 2016Learning in games with continuous action sets and unknown payoff functionscited by 78
  12. 2020Model Selection in Contextual Stochastic Bandit Problemscited by 71
9 more
  1. 2019Model selection for contextual banditscited by 60
  2. 2021Who Leads and Who Follows in Strategic Classification?cited by 53
  3. 2018On Gradient-Based Learning in Continuous Gamescited by 46
  4. 2022Scaling Laws for a Multi-Agent Reinforcement Learning Modelcited by 37
  5. 2023Algorithmic Collective Action in Machine Learningcited by 30
  6. 2019Simple and optimal high-probability bounds for strongly-convex stochastic gradient descentcited by 25
  7. 2023Improved Bayes Risk Can Yield Reduced Social Welfare Under Competitioncited by 14
  8. 2023Strategic Distribution Shift of Interacting Agents via Coupled Gradient Flowscited by 5
  9. 2016Informational Braess' Paradox: The Effect of Information on Traffic Congestioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.