Data-Consistent Learning of Inverse Problems

Markus Haltmeier, Gyeongha Hwang
1/19/2026
math.NAcs.CV

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Inverse problems are inherently ill-posed, suffering from non-uniqueness and instability. Classical regularization methods provide mathematically well-founded solutions, ensuring stability and convergence, but often at the cost of reduced flexibility or visual quality. Learned reconstruction methods, such as convolutional neural networks, can produce visually compelling results, yet they typically lack rigorous theoretical guarantees. DC (DC) networks address this gap by enforcing the measurement model within the network architecture. In particular, null-space networks combined with a classical regularization method as an initial reconstruction define a convergent regularization method. This approach preserves the theoretical reliability of classical schemes while leveraging the expressive power of data-driven learning, yielding reconstructions that are both accurate and visually appealing.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{haltmeier2026dataconsistent,
  title  = {Data-Consistent Learning of Inverse Problems},
  author = {Markus Haltmeier and Gyeongha Hwang},
  year   = {2026},
  eprint = {2601.12831},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.12831v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.12831.svg)](https://codeofpaper.com/paper/2601.12831)

Discussion