Quantifying the Complexity and Learnability of Strategic Classification Problems

How generalizing the notion of VC dimension to a strategic setting can help us understand whether or not a problem is learnable

Image generated by the author using DALL-E 3.

In the first article in this series, we formally defined the strategic classification problem, denoted Sᴛʀᴀᴄ⟨H, R, c⟩, as a generalization of canonical binary classification. We did so based on the paper PAC-Learning for Strategic Classification (Sundaram, Vullikanti, Xu, & Yao, 2021). Along …

article author canonical classification classification-algorithms complexity dall dall-e dall-e 3 game theory generated machine learning notion series thoughts-and-theory