Bayesian view on the training of invertible residual networks for solving linear inverse problems

• Published in: Inverse problems Vol. 40; no. 4; pp. 45021 - 45069
• Main Authors: Arndt, Clemens, Dittmer, Sören, Heilenkötter, Nick, Iske, Meira, Kluth, Tobias, Nickel, Judith
• Format: Journal Article
• Language: English
• Published: IOP Publishing 01.04.2024
• Subjects: Bayesian inverse problems; iResNet; learned regularization; linear inverse problems
• ISSN: 0266-5611; 1361-6420
• DOI: 10.1088/1361-6420/ad2aaa

Abstract Learning-based methods for inverse problems, adapting to the data’s inherent structure, have become ubiquitous in the last decade. Besides empirical investigations of their often remarkable performance, an increasing number of works address the issue of theoretical guarantees. Recently, Arndt et al (2023 Inverse Problems 39 125018) exploited invertible residual networks (iResNets) to learn provably convergent regularizations given reasonable assumptions. They enforced these guarantees by approximating the linear forward operator with an iResNet. Supervised training on relevant samples introduces data dependency into the approach. An open question in this context is to which extent the data’s inherent structure influences the training outcome, i.e. the learned reconstruction scheme. Here, we address this delicate interplay of training design and data dependency from a Bayesian perspective and shed light on opportunities and limitations. We resolve these limitations by analyzing reconstruction-based training of the inverses of iResNets, where we show that this optimization strategy introduces a level of data-dependency that cannot be achieved by approximation training. We further provide and discuss a series of numerical experiments underpinning and extending the theoretical findings.