论文标题
我们可以单独从数据中实现鲁棒性吗?
Can we achieve robustness from data alone?
论文作者
论文摘要
我们引入了一种元学习算法,用于对抗性稳健分类。所提出的方法试图尽可能尽可能地模型,并在其在机器学习系统中部署之前优化数据集,旨在有效删除其非舒适特征。创建数据集后,原则上不需要专门的算法(除了标准梯度下降)来训练强大的模型。我们将数据优化程序作为内核回归的双层优化问题制定,并用一类描述无限宽神经网(神经切线核)的内核。我们使用各种不同模型对标准计算机视觉基准进行了广泛的实验,证明了我们方法的有效性,同时还指出了当前的缺点。同时,我们重新审视了先前的工作,该工作也集中在适用的分类\ citep {illy+19}的数据优化问题上,并表明在标准数据集(梯度下降)培训后对对抗性攻击的鲁棒性更具挑战性。
We introduce a meta-learning algorithm for adversarially robust classification. The proposed method tries to be as model agnostic as possible and optimizes a dataset prior to its deployment in a machine learning system, aiming to effectively erase its non-robust features. Once the dataset has been created, in principle no specialized algorithm (besides standard gradient descent) is needed to train a robust model. We formulate the data optimization procedure as a bi-level optimization problem on kernel regression, with a class of kernels that describe infinitely wide neural nets (Neural Tangent Kernels). We present extensive experiments on standard computer vision benchmarks using a variety of different models, demonstrating the effectiveness of our method, while also pointing out its current shortcomings. In parallel, we revisit prior work that also focused on the problem of data optimization for robust classification \citep{Ily+19}, and show that being robust to adversarial attacks after standard (gradient descent) training on a suitable dataset is more challenging than previously thought.