Learning Regularization Functionals for Inverse Problems: A Comparative Study

• URL: http://arxiv.org/abs/2510.01755v1
• Date: Thu, 02 Oct 2025 07:42:28 GMT
• Title: Learning Regularization Functionals for Inverse Problems: A Comparative Study
• Authors: Johannes Hertrich, Hok Shing Wong, Alexander Denker, Stanislas Ducotterd, Zhenghan Fang, Markus Haltmeier, Željko Kereta, Erich Kobler, Oscar Leong, Mohammad Sadegh Salehi, Carola-Bibiane Schönlieb, Johannes Schwab, Zakhar Shumaylov, Jeremias Sulam, German Shâma Wache, Martin Zach, Yasi Zhang, Matthias J. Ehrhardt, Sebastian Neumayer,
• Abstract summary: A variety of learned regularization frameworks for solving inverse problems in imaging have emerged.<n>These offer flexible modeling together with mathematical insights.<n>We address this gap by collecting and unifying the available code into a common framework.
• Score: 57.289041896491206
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, a variety of learned regularization frameworks for solving inverse problems in imaging have emerged. These offer flexible modeling together with mathematical insights. The proposed methods differ in their architectural design and training strategies, making direct comparison challenging due to non-modular implementations. We address this gap by collecting and unifying the available code into a common framework. This unified view allows us to systematically compare the approaches and highlight their strengths and limitations, providing valuable insights into their future potential. We also provide concise descriptions of each method, complemented by practical guidelines.

Related papers

• A Survey on Prompt Tuning [32.4489985319054]
  We classify existing approaches into two categories: direct prompt learning and transfer learning.<n>For each method, we analyze method designs, innovations, insights, advantages, and disadvantages.<n>We discuss future directions in improving training robustness and broadening application scope.
  arXiv  Detail & Related papers  (2025-07-08T15:24:27Z)
• Supervised Fine-Tuning as Inverse Reinforcement Learning [8.044033685073003]
  The prevailing approach to aligning Large Language Models (LLMs) typically relies on human or AI feedback. In our work, we question the efficacy of such datasets and explore various scenarios where alignment with expert demonstrations proves more realistic.
  arXiv  Detail & Related papers  (2024-03-18T17:52:57Z)
• Unsupervised approaches based on optimal transport and convex analysis for inverse problems in imaging [6.202226277935329]
  We review theoretically principled unsupervised learning schemes for solving imaging inverse problems. We focus on methods rooted in optimal transport and convex analysis. We give an overview of a recent line of works on provably convergent learned optimization algorithms.
  arXiv  Detail & Related papers  (2023-11-15T14:04:37Z)
• Deep Generative Models for Decision-Making and Control [4.238809918521607]
  The dual purpose of this thesis is to study the reasons for these shortcomings and to propose solutions for the uncovered problems. We highlight how inference techniques from the contemporary generative modeling toolbox, including beam search, can be reinterpreted as viable planning strategies for reinforcement learning problems.
  arXiv  Detail & Related papers  (2023-06-15T01:54:30Z)
• Model-Based Deep Learning: On the Intersection of Deep Learning and Optimization [101.32332941117271]
  Decision making algorithms are used in a multitude of different applications. Deep learning approaches that use highly parametric architectures tuned from data without relying on mathematical models are becoming increasingly popular. Model-based optimization and data-centric deep learning are often considered to be distinct disciplines.
  arXiv  Detail & Related papers  (2022-05-05T13:40:08Z)
• A Survey on Deep Semi-supervised Learning [51.26862262550445]
  We first present a taxonomy for deep semi-supervised learning that categorizes existing methods. We then offer a detailed comparison of these methods in terms of the type of losses, contributions, and architecture differences.
  arXiv  Detail & Related papers  (2021-02-28T16:22:58Z)
• Behavior Priors for Efficient Reinforcement Learning [97.81587970962232]
  We consider how information and architectural constraints can be combined with ideas from the probabilistic modeling literature to learn behavior priors. We discuss how such latent variable formulations connect to related work on hierarchical reinforcement learning (HRL) and mutual information and curiosity based objectives. We demonstrate the effectiveness of our framework by applying it to a range of simulated continuous control domains.
  arXiv  Detail & Related papers  (2020-10-27T13:17:18Z)
• Reinforcement Learning as Iterative and Amortised Inference [62.997667081978825]
  We use the control as inference framework to outline a novel classification scheme based on amortised and iterative inference. We show that taking this perspective allows us to identify parts of the algorithmic design space which have been relatively unexplored.
  arXiv  Detail & Related papers  (2020-06-13T16:10:03Z)
• Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization [96.1052289276254]
  We consider the maximum-a-posteriori inference problem in discrete graphical models and study solvers based on the dual block-coordinate ascent rule. We map all existing solvers in a single framework, allowing for a better understanding of their design principles.
  arXiv  Detail & Related papers  (2020-04-16T15:49:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.