mlsanityData to 14 Oct 2026

Learning convex regularizers satisfying the variational source condition for inverse problems

arXiv 2110.12520 ↗First posted 24 Oct 2021cs.LG eess.IVcited by 8

Not on the map. Why?

Abstract (arXiv)

Variational regularization has remained one of the most successful approaches for reconstruction in imaging inverse problems for several decades. With the emergence and astonishing success of deep learning in recent years, a considerable amount of research has gone into data-driven modeling of the regularizer in the variational setting. Our work extends a recently proposed method, referred to as adversarial convex regularization (ACR), that seeks to learn data-driven convex regularizers via adversarial training in an attempt to combine the power of data with the classical convex regularization theory. Specifically, we leverage the variational source condition (SC) during training to enforce that the ground-truth images minimize the variational loss corresponding to the learned convex regularizer. This is achieved by adding an appropriate penalty term to the ACR training objective. The resulting regularizer (abbreviated as ACR-SC) performs on par with the ACR, but unlike ACR, comes with a quantitative convergence rate estimate.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 7 of its 13 references that are in the map. First posted on arXiv 24 Oct 2021.

Builds on

7 of 13 references.

References · 7

  1. 2017Improved Training of Wasserstein GANscited by 2,235
  2. 2016Deep Convolutional Neural Network for Inverse Problems in Imagingcited by 433
  3. 2016Input Convex Neural Networkscited by 414
  4. 2018Adversarial Regularizers in Inverse Problemscited by 103
  5. 2018NETT: Solving Inverse Problems with Deep Neural Networkscited by 89
  6. 2020Learned convex regularizers for inverse problemscited by 55
  7. 2020Total Deep Variation for Linear Inverse Problemscited by 53

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 3; 2025: 2.

8 papers.