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 Jonathan Yahav · Follow Published in Towards Data Science · 8 min read · 7 hours ago — 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