提出新方法让非线性分类器在策略性场景中实用化
Non-Linear Strategic Classification Made Practical

- 用拉格朗日对偶重构策略响应,支持非线性模型优化
- 在多个数据集上显著提升策略性分类准确率
- 适合研究策略学习与对抗性机器学习的从业者
战略分类中的算法研究长期局限于线性分类器,且仅在最优响应有闭式解或易近似时可行。尽管已有研究探讨非线性分类器在策略环境中的作用,但其进展受限于策略行为的计算难解性。本文提出一种基于拉格朗日对偶的新方法来近似最优响应。通过将战略响应重新表述为带约束的优化问题,构建可使用一阶优化方法处理的拉格朗日函数。该方法在线性设置中复现了闭式响应行为,并可直接推广至非线性情形。结合隐函数定理,我们提出的方法可在分类器训练中高效计算损失的总梯度,实现分类器参数与后续策略行为的直接连接,从而设计出新型训练算法。实验表明,所提模型在常见机器学习数据集上实现了更高的战略准确性。
原文摘要 · Abstract (English)
Algorithmic developments in Strategic Classification have been mostly limited to linear classifiers in settings where the best response has a closed-form solution or can be easily approximated. While some work has explored the role of non-linear classifiers in strategic settings, progress in this direction is impeded by the computational intractability of the strategic behaviour. Addressing this, we present a novel method for approximating the best response by exploiting Lagrangian duality. By reformulating the strategic response as a constrained optimisation problem, we can construct a Lagrangian that is amenable to first order optimisation methods. This approach reproduces closed-form strategic behaviour in linear settings and can be straight-forwardly applied to non-linear settings. We show how the Implicit Function Theorem can be used in conjunction with our proposed response formulation during classifier learning to compute the total gradient of the loss. This connects the classifier parameters directly to the consequent strategic behaviour, yielding a novel training algorithm that can exploit this relationship. Experimental evaluation shows that the resulting models achieve improved strategic accuracy on common machine learning datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。