哥德尔的句子是一个对立的例子,但无法解决
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。