Papers › Recovery Guarantees for Compressible Signals with Adversarial Noise
Recovery Guarantees for Compressible Signals with Adversarial Noise
Jasjeet Dhaliwal, Kyle Hambrook
We provide recovery guarantees for compressible signals that have been corrupted with noise and extend the framework introduced in \cite{bafna2018thwarting} to defend neural networks against ℓ₀-norm, ℓ₂-norm, and ℓ_∞-norm attacks. Our results are general as they can be applied to most unitary transforms used in practice and hold for ℓ₀-norm, ℓ₂-norm, and ℓ_∞-norm bounded noise. In the case of ℓ₀-norm noise, we prove recovery guarantees for Iterative Hard Thresholding (IHT) and Basis Pursuit (BP). For ℓ₂-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 \cite{bafna2018thwarting} for defending neural networks against adversarial inputs. Finally, we experimentally demonstrate the effectiveness of this defense framework against an array of ℓ₀, ℓ₂ and ℓ_∞ norm attacks.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections