论文标题
戈德尔的句子是一个对抗性的例子，但无法解决
Gödel's Sentence Is An Adversarial Example But Unsolvable
论文作者
论文摘要
近年来，来自不同领域的不同类型的对抗例子已经不断出现，其中包括纯粹的天然无扰动。提出了各种防御，然后迅速打破。需要问两个基本问题：存在对抗性例子的原因是什么，并且对抗性例子是无法解决的吗？在本文中，我们将展示存在对抗性示例的原因，这是有非同构自然解释可以解释数据集。具体而言，对于两个自然解释是真实和可证明的，戈德尔的句子是一个对抗性的例子，但无法降低。可以通过重新积累数据集或学习算法的重新投入来解决它。最后，从可计算性的角度来看，我们将证明对对抗性示例的无可何不是无法识别的。
In recent years, different types of adversarial examples from different fields have emerged endlessly, including purely natural ones without perturbations. A variety of defenses are proposed and then broken quickly. Two fundamental questions need to be asked: What's the reason for the existence of adversarial examples and are adversarial examples unsolvable? In this paper, we will show the reason for the existence of adversarial examples is there are non-isomorphic natural explanations that can all explain data set. Specifically, for two natural explanations of being true and provable, Gödel's sentence is an adversarial example but ineliminable. It can't be solved by the re-accumulation of data set or the re-improvement of learning algorithm. Finally, from the perspective of computability, we will prove the incomputability for adversarial examples, which are unrecognizable.
