AI RESEARCH
Strategic PAC Learnability via Geometric Definability
arXiv CS.LG
•
ArXi:2605.13426v1 Announce Type: new Strategic classification studies learning settings in which individuals can modify their features, at a cost, in order to influence the classifier's decision. A central question is how the sample complexity of the induced (strategic) hypothesis class depends on the complexities of the underlying hypothesis class and the cost structure governing feasible manipulations. Prior work has shown that in several natural settings, such as linear classifiers with norm costs, the induced complexity can be controlled.