对抗鲁棒分类器的一致收敛性
Uniform Convergence of Adversarially Robust Classifiers
AI总结:
针对对抗性扰动分类问题,本研究在大数据极限下构建通用框架,证明对抗强度趋近零时最优分类器在豪斯多夫距离下收敛于贝叶斯分类器,显著强化了以往L¹型收敛的结果。
摘要:
近年来,人们对数据分类问题中不同类型对抗性扰动的影响产生了极大兴趣。许多这类模型都纳入了对抗能力,这是一个重要参数,涉及准确性与鲁棒性之间的权衡。本研究考虑了一个适用于对抗性扰动分类问题的通用框架,处于大数据或总体水平极限下。在此机制中,我们证明当对抗强度趋近于零时,最优分类器在豪斯多夫距离下收敛于贝叶斯分类器。这显著强化了以往通常聚焦于L¹型收敛的结果。主要论证依赖直接几何比较,受几何测度论技术启发。
英文摘要:
In recent years there has been significant interest in the effect of different types of adversarial perturbations in data classification problems. Many of these models incorporate the adversarial power, which is an important parameter with an associated trade-off between accuracy and robustness. This work considers a general framework for adversarially-perturbed classification problems, in a large data or population-level limit. In such a regime, we demonstrate that as adversarial strength goes to zero that optimal classifiers converge to the Bayes classifier in the Hausdorff distance. This significantly strengthens previous results, which generally focus on $L^1$-type convergence. The main argument relies upon direct geometric comparisons and is inspired by techniques from geometric measure theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。