arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.06993cs.CRcs.LG
收藏

Adversarial Examples and Metrics

CISPA Helmholtz Center for Information Security(CISPA亥姆霍兹信息安全中心);IBM T. J. Watson Research Center(IBM T. J. 沃森研究中心)

Nico Döttling, Kathrin Grosse, Michael Backes, Ian Molloy

英文摘要:

Adversarial examples are a type of attack on machine learning (ML) systems which cause misclassification of inputs. Achieving robustness against adversarial examples is crucial to apply ML in the real world. While most prior work on adversarial examples is empirical, a recent line of work establishes fundamental limitations of robust classification based on cryptographic hardness. Most positive and negative results in this field however assume that there is a fixed target metric which constrains the adversary, and we argue that this is often an unrealistic assumption. In this work we study the limitations of robust classification if the target metric is uncertain. Concretely, we construct a classification problem, which admits robust classification by a small classifier if the target metric is known at the time the model is trained, but for which robust classification is impossible for small classifiers if the target metric is chosen after the fact. In the process, we explore a novel connection between hardness of robust classification and bounded storage model cryptography.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑