Jonathan Yahav

AI

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

Read More »
AI

Extending PAC Learning to a Strategic Classification Setting

A case study of the meeting point between game theory and fundamental concepts in machine learning Jonathan Yahav · Follow Published in Towards Data Science · 10 min read · 9 hours ago — Last semester, I took a seminar in Incentives and Learning. The papers we discussed throughout the course dealt with the overlap between the fields of game theory and machine learning. I had very little familiarity with formal game theory beforehand, and

Read More »