Memory Efficient Full-gradient Attacks (MEFA) Framework for Adversarial Defense Evaluations
Yuan Du, Mitchel Hill, HanQin Cai

TL;DR
This paper introduces a memory-efficient framework for exact gradient evaluation in stochastic purification defenses, enabling stronger white-box attacks and more reliable robustness assessments.
Contribution
It presents a novel framework combining checkpointed backpropagation and controlled stochastic evaluation to accurately evaluate defenses with reduced memory usage.
Findings
Full-gradient attacks reveal vulnerabilities missed by approximate methods.
The framework produces stronger white-box attacks on diffusion-based defenses.
Exact-gradient evaluation improves robustness benchmarking reliability.
Abstract
This work studies the robust evaluation of iterative stochastic purification defenses under white-box adversarial attacks. Our key technical insight is that gradient checkpointing makes exact end-to-end gradient computation through long purification trajectories practical by trading additional recomputation for substantially lower memory usage. This enables full-gradient adaptive attacks against diffusion- and Langevin-based purification defenses, where prior evaluations often resort to approximate backpropagation due to memory constraints. These approximations can weaken the attack signal and risk overestimating robustness. In parallel, stochasticity in iterative purification is frequently under-controlled, even though different purification trajectories can substantially change reported robustness metrics. Building on this insight, we introduce a memory-efficient full-gradient…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
