mlsanityData to 14 Oct 2026

Adversarial Examples from Cryptographic Pseudo-Random Generators

arXiv 1811.06418 ↗First posted 15 Nov 2018cs.LG cs.CC cs.CRcited by 10

Not on the map. Why?

Abstract (arXiv)

In our recent work (Bubeck, Price, Razenshteyn, arXiv:1805.10204) we argued that adversarial examples in machine learning might be due to an inherent computational hardness of the problem. More precisely, we constructed a binary classification task for which (i) a robust classifier exists; yet no non-trivial accuracy can be obtained with an efficient algorithm in (ii) the statistical query model. In the present paper we significantly strengthen both (i) and (ii): we now construct a task which admits (i') a maximally robust classifier (that is it can tolerate perturbations of size comparable to the size of the examples themselves); and moreover we prove computational hardness of learning this task under (ii') a standard cryptographic assumption.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Nov 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 2; 2023: 2.

10 papers.