Recovery Guarantees for Compressible Signals with Adversarial Noise
Abstract
We provide recovery guarantees for compressible signals that have been corrupted with noise and extend the framework introduced in bafna2018thwarting to defend neural networks against 0-norm, 2-norm, and ∞-norm attacks. Our results are general as they can be applied to most unitary transforms used in practice and hold for 0-norm, 2-norm, and ∞-norm bounded noise. In the case of 0-norm noise, we prove recovery guarantees for Iterative Hard Thresholding (IHT) and Basis Pursuit (BP). For 2-norm bounded noise, we provide recovery guarantees for BP and for the case of ∞-norm bounded noise, we provide recovery guarantees for Dantzig Selector (DS). These guarantees theoretically bolster the defense framework introduced in bafna2018thwarting for defending neural networks against adversarial inputs. Finally, we experimentally demonstrate the effectiveness of this defense framework against an array of 0, 2 and ∞ norm attacks.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.