REVIEW 2 cited by
NETT: Solving Inverse Problems with Deep Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Recovering a function or high-dimensional parameter vector from indirect measurements is a central task in various scientific areas. Several methods for solving such inverse problems are well developed and well understood. Recently, novel algorithms using deep learning and neural networks for inverse problems appeared. While still in their infancy, these techniques show astonishing performance for applications like low-dose CT or various sparse data problems. However, there are few theoretical results for deep learning in inverse problems. In this paper, we establish a complete convergence analysis for the proposed NETT (Network Tikhonov) approach to inverse problems. NETT considers data consistent solutions having small value of a regularizer defined by a trained neural network. We derive well-posedness results and quantitative error estimates, and propose a possible strategy for training the regularizer. Our theoretical results and framework are different from any previous work using neural networks for solving inverse problems. A possible data driven regularizer is proposed. Numerical results are presented for a tomographic sparse data problem, which demonstrate good performance of NETT even for unknowns of different type from the training data. To derive the convergence and convergence rates results we introduce a new framework based on the absolute Bregman distance generalizing the standard Bregman distance from the convex to the non-convex case.
Forward citations
Cited by 2 Pith papers
-
Variational Sparse Paired Autoencoders (vsPAIR) for Inverse Problems and Uncertainty Quantification
vsPAIR couples a Gaussian VAE over observations with a spike-and-slab sparse VAE over the quantity of interest via a learned latent mapping, yielding fast inverse reconstructions whose active latent dimensions can be ...
-
Few-Shot Test-Time Optimization Without Retraining for Semiconductor Recipe Generation and Beyond
A two-loop reverse-model method for test-time input optimization is claimed to find semiconductor etching recipes in five iterations, but the supporting evidence is simulation-only and not reproducible.
Discussion (0). Continue with ORCID to comment.