SGD Jittering: A Training Strategy for Robust and Accurate Model-Based Architectures
Not on the map. Why?
Abstract (arXiv)
Inverse problems aim to reconstruct unseen data from corrupted or perturbed measurements. While most work focuses on improving reconstruction quality, generalization accuracy and robustness are equally important, especially for safety-critical applications. Model-based architectures (MBAs), such as loop unrolling methods, are considered more interpretable and achieve better reconstructions. Empirical evidence suggests that MBAs are more robust to perturbations than black-box solvers, but the accuracy-robustness tradeoff in MBAs remains underexplored. In this work, we propose a simple yet effective training scheme for MBAs, called SGD jittering, which injects noise iteration-wise during reconstruction. We theoretically demonstrate that SGD jittering not only generalizes better than the standard mean squared error training but is also more robust to average-case attacks. We validate SGD jittering using denoising toy examples, seismic deconvolution, and single-coil MRI reconstruction. Both SGD jittering and its SPGD extension yield cleaner reconstructions for out-of-distribution data and demonstrates enhanced robustness against adversarial attacks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 68 references that are in the map. First posted on arXiv 18 Oct 2024.
Builds on
49 of 68 references.
References · 49
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2018Robustness May Be at Odds with Accuracycited by 880
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2019Adversarial Training for Free!cited by 643
- 2017Exploring Generalization in Deep Learningcited by 600
37 more
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 468
- 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
- 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 330
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
- 2021Deblurring via Stochastic Refinementcited by 249
- 2018Adversarial Logit Pairingcited by 224
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 184
- 2018Disentangling Adversarial Robustness and Generalizationcited by 172
- 2021On the Convergence and Robustness of Adversarial Trainingcited by 130
- 2021Deep Equilibrium Architectures for Inverse Problems in Imagingcited by 127
- 2022Adaptive Diffusion Priors for Accelerated MRI Reconstructioncited by 118
- 2019Adversarial Examples Are a Natural Consequence of Test Error in Noisecited by 114
- 2022Robustness and Accuracy Could Be Reconcilable by (Proper) Definitioncited by 111
- 2016Robustness of classifiers: from adversarial to random noisecited by 88
- 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
- 2021Benign Overfitting of Constant-Stepsize SGD for Linear Regressioncited by 71
- 2020Solving Inverse Problems With Deep Neural Networks -- Robustness Included?cited by 58
- 2019Stochastic Gradient Descent for Nonconvex Learning without Bounded Gradient Assumptionscited by 48
- 2019First Exit Time Analysis of Stochastic Gradient Descent Under Heavy-Tailed Gradient Noisecited by 44
- 2023Convex and Non-convex Optimization Under Generalized Smoothnesscited by 44
- 2021Noisy Recurrent Neural Networkscited by 42
- 2022Anticorrelated Noise Injection for Improved Generalizationcited by 42
- 2020The troublesome kernel -- On hallucinations, no free lunches and the accuracy-stability trade-off in inverse problemscited by 40
- 2020High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noisecited by 31
- 2022HUMUS-Net: Hybrid unrolled multi-scale network architecture for accelerated MRI reconstructioncited by 30
- 2022Explicit Regularization in Overparametrized Models via Noise Injectioncited by 26
- 2024Plug-and-Play image restoration with Stochastic deNOising REgularizationcited by 17
- 2021Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorizationcited by 15
- 2023Mitigating Accuracy-Robustness Trade-off via Balanced Multi-Teacher Adversarial Distillationcited by 13
- 2023Learning Provably Robust Estimators for Inverse Problems via Jitteringcited by 8
- 2020Adversarial Robust Training of Deep Learning MRI Reconstruction Modelscited by 6
- 2022Robust Regression with Highly Corrupted Data via Physics Informed Neural Networkscited by 4
- 2024Solving Inverse Problems with Model Mismatch using Untrained Neural Networks within Model-based Architecturescited by 3
- 2024A Brief Overview of Optimization-Based Algorithms for MRI Reconstruction Using Deep Learningcited by 3
- 2021Adversarial Tradeoffs in Robust State Estimationcited by 1
Built on by
Not cited yet.