Quantifying the complexity and learnability of strategic classification problems | by Jonathan Yahav | April 2024
Counting reachable labels: canonical breaking coefficientsVerbally defining breakdown coefficients seems simple at first glance:Given a class of hypotheses h, is ...