mlsanityData to 7 Oct 2026

Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation

arXiv 2402.01052 ↗First posted 1 Feb 2024math.OC cs.CV cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Variational regularisation is the primary method for solving inverse problems, and recently there has been considerable work leveraging deeply learned regularisation for enhanced performance. However, few results exist addressing the convergence of such regularisation, particularly within the context of critical points as opposed to global minimisers. In this paper, we present a generalised formulation of convergent regularisation in terms of critical points, and show that this is achieved by a class of weakly convex regularisers. We prove convergence of the primal-dual hybrid gradient method for the associated variational problem, and, given a Kurdyka-Lojasiewicz condition, an O(logk/k) ergodic convergence rate. Finally, applying this theory to learned regularisation, we prove universal approximation for input weakly convex neural networks (IWCNN), and show empirically that IWCNNs can lead to improved performance of learned adversarial regularisers for computed tomography (CT) reconstruction.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 40 of its 85 references that are in the map. First posted on arXiv 1 Feb 2024.

Builds on

40 of 85 references.

References · 40

  1. 2017Deep Image Priorcited by 1,097
  2. 2016Deep Convolutional Neural Network for Inverse Problems in Imagingcited by 431
  3. 2016Input Convex Neural Networkscited by 407
  4. 2016The Little Engine that Could: Regularization by Denoising (RED)cited by 303
  5. 2017Learned Primal-dual Reconstructioncited by 251
  6. 2017Image reconstruction by domain transform manifold learningcited by 231
  7. 2019Universal Approximation with Deep Narrow Networkscited by 198
  8. 2017Universal Function Approximation by Deep Neural Nets with Bounded Width and ReLU Activationscited by 104
  9. 2018Adversarial Regularizers in Inverse Problemscited by 102
  10. 2022Plug-and-Play Methods for Integrating Physical and Learned Models in Computational Imagingcited by 94
  11. 2018NETT: Solving Inverse Problems with Deep Neural Networkscited by 89
  12. 2018Optimal Control Via Neural Networks: A Convex Approachcited by 82
28 more
  1. 2022Proximal Denoiser for Convergent Plug-and-Play Optimization with Nonconvex Regularizationcited by 79
  2. 2016Efficiency of minimizing compositions of convex functions and smooth mapscited by 59
  3. 2020Learned convex regularizers for inverse problemscited by 54
  4. 2020Total Deep Variation for Linear Inverse Problemscited by 53
  5. 2021Recovery of Continuous 3D Refractive Index Maps from Discrete Intensity-Only Measurements using Neural Fieldscited by 48
  6. 2022Learned reconstruction methods with convergence guaranteescited by 46
  7. 2018Subgradient methods for sharp weakly convex functionscited by 33
  8. 2019Block Coordinate Regularization by Denoisingcited by 33
  9. 2018Stochastic subgradient method converges at the rate O(k-1/4) on weakly convex functionscited by 31
  10. 2023Learning Weakly Convex Regularizers for Convergent Image-Reconstruction Algorithmscited by 30
  11. 2018Regularization by architecture: A deep prior approach for inverse problemscited by 26
  12. 2021Learning the optimal Tikhonov regularizer for inverse problemscited by 26
  13. 2020Variable Smoothing for Weakly Convex Composite Functionscited by 12
  14. 2023A relaxed proximal gradient descent algorithm for convergent plug-and-play with proximal denoisercited by 12
  15. 2020Nonconvex regularization for sparse neural networkscited by 7
  16. 2022On the Uniqueness of Kantorovich Potentialscited by 7
  17. 2022Improved Imaging by Invex Regularizers with Global Optima Guaranteescited by 6
  18. 2022Optimal Regularization for a Data Sourcecited by 6
  19. 2018Unveiling the invisible - mathematical methods for restoring and interpreting illuminated manuscriptscited by 5
  20. 2023On a Unified and Simplified Proof for the Ergodic Convergence Rates of PPM, PDHG and ADMMcited by 5
  21. 2014The Primal-Dual Hybrid Gradient Method for Semiconvex Splittingscited by 4
  22. 2023Provably Convergent Data-Driven Convex-Nonconvex Regularizationcited by 4
  23. 2022Convergence analysis of critical point regularization with non-convex regularizerscited by 2
  24. 2022Joint reconstruction-segmentation on graphscited by 2
  25. 2022A new method for determining Wasserstein 1 optimal transport maps from Kantorovich potentials, with deep learning applicationscited by 2
  26. 2023Convergence rates for critical point regularizationcited by 2
  27. 2023Convergence analysis of equilibrium methods for inverse problemscited by 2
  28. 2023Preconditioned Primal-Dual Gradient Methods for Nonconvex Composite and Finite-Sum Optimizationcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 4; 2025: 8.

12 papers.