Pith. sign in

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

arxiv 1803.00092 v3 pith:AJDVARO3 submitted 2018-02-28 math.NA cs.LGcs.NA

classification math.NAcs.LGcs.NA
keywords problemsinversedataresultsnettneuralconvergencedeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Variational Sparse Paired Autoencoders (vsPAIR) for Inverse Problems and Uncertainty Quantification

    cs.LG 2026-02 conditional novelty 5.0 of 10

    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 ...

  2. Few-Shot Test-Time Optimization Without Retraining for Semiconductor Recipe Generation and Beyond

    cs.LG 2025-05 reject novelty 4.0 of 10

    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.

Pith tools