Total Deep Variation: A Stable Regularizer for Inverse Problems
Not on the map. Why?
Abstract (arXiv)
Various problems in computer vision and medical imaging can be cast as inverse problems. A frequent method for solving inverse problems is the variational approach, which amounts to minimizing an energy composed of a data fidelity term and a regularizer. Classically, handcrafted regularizers are used, which are commonly outperformed by state-of-the-art deep learning approaches. In this work, we combine the variational formulation of inverse problems with deep learning by introducing the data-driven general-purpose total deep variation regularizer. In its core, a convolutional neural network extracts local features on multiple scales and in successive blocks. This combination allows for a rigorous mathematical analysis including an optimal control formulation of the training problem in a mean-field setting and a stability analysis with respect to the initial values and the parameters of the regularizer. In addition, we experimentally verify the robustness against adversarial attacks and numerically derive upper bounds for the generalization error. Finally, we achieve state-of-the-art results for numerous imaging tasks.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
9 papers.
- 2021Learning to Optimize: A Primer and A Benchmarkcited by 206
- 2021Can stable and accurate neural networks be computed? -- On the barriers of deep learning and Smale's 18th problemcited by 53
- 2021Bayesian Uncertainty Estimation of Learned Variational MRI Reconstructioncited by 30
- 2022Optimal Regularization for a Data Sourcecited by 6
- 2022PAC-Bayesian Learning of Optimization Algorithmscited by 4
- 2021WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditionscited by 1
- 2022Learning-Assisted Algorithm Unrolling for Online Optimization with Budget Constraintscited by 1
- 2024A Generalization Result for Convergence in Learning-to-Optimizecited by 1
- 2026Regularizing Attention Scores with Bootstrappingcited by 0
- 2026Regularizing Attention Scores with Bootstrapping1 Apr 2026
- 2024A Generalization Result for Convergence in Learning-to-Optimize10 Oct 2024
- 2022Optimal Regularization for a Data Source27 Dec 2022
- 2022Learning-Assisted Algorithm Unrolling for Online Optimization with Budget Constraints3 Dec 2022
- 2022PAC-Bayesian Learning of Optimization Algorithms20 Oct 2022
- 2021WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditions24 Oct 2021
- 2021Learning to Optimize: A Primer and A Benchmark23 Mar 2021
- 2021Bayesian Uncertainty Estimation of Learned Variational MRI Reconstruction12 Feb 2021
- 2021Can stable and accurate neural networks be computed? -- On the barriers of deep learning and Smale's 18th problem20 Jan 2021