Pith. sign in

REVIEW 10 cited by

DeepInverse: A Python package for solving imaging inverse problems with deep learning

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 2505.20160 v2 pith:GO54BWS2 submitted 2025-05-26 eess.IV

DeepInverse: A Python package for solving imaging inverse problems with deep learning

classification eess.IV
keywords libraryproblemsdeepinversedesignimaginginversemainsolving
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

DeepInverse is an open-source PyTorch-based library for solving imaging inverse problems. The library covers all crucial steps in image reconstruction from the efficient implementation of forward operators (e.g., optics, MRI, tomography), to the definition and resolution of variational problems and the design and training of advanced neural network architectures. In this paper, we describe the main functionality of the library and discuss the main design choices.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

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

  1. Geometry-Aware Discretization Error of Diffusion Models

    cs.LG 2026-05 unverdicted novelty 7.0

    First-order asymptotic expansions of weak and Fréchet discretization errors in diffusion sampling are derived, explicit under Gaussian data through covariance geometry and robust to other data geometries.

  2. P-Flow: Proxy-gradient Flows for Linear Inverse Problems

    cs.LG 2026-05 unverdicted novelty 7.0

    P-Flow stabilizes flow-matching models for inverse problems via proxy gradients and Gaussian spherical projections, avoiding long-chain differentiation while maintaining prior consistency.

  3. Preconditioned Regularized Wasserstein Proximal Sampling

    stat.ML 2025-09 unverdicted novelty 7.0

    A preconditioned regularized Wasserstein proximal sampling algorithm is introduced for particle-based approximation of Gibbs distributions, featuring a PDE-derived kernel formulation and non-asymptotic convergence ana...

  4. Deep Scene-Driven Ordering of Hadamard Basis for Single-Pixel Spectral Imaging

    eess.IV 2026-07 conditional novelty 6.0

    A scene-driven neural network orders Hadamard sensing patterns for single-pixel spectral imaging, improving VIS/NIR reconstructions over fixed orderings at low sampling ratios.

  5. PnP-IPA: A Provably Convergent Plug-and-Play Inexact Proximal Algorithm for Nonconvex Imaging Problems

    math.NA 2026-07 accept novelty 6.0

    An inexact proximal PnP algorithm with adaptive line search converges globally for nonconvex imaging objectives without any bound on the regularization parameter.

  6. P-Flow: Proxy-gradient Flows for Linear Inverse Problems

    cs.LG 2026-05 conditional novelty 6.0

    P-Flow solves linear inverse problems by optimizing the flow's source latent with a proxy gradient and a Gaussian-sphere projection, matching or beating prior restoration methods at far lower cost.

  7. UTOPY: Unrolling Algorithm Learning via Fidelity Homotopy for Inverse Problems

    eess.IV 2025-09 unverdicted novelty 6.0

    UTOPY trains unrolling algorithms for ill-posed inverse problems via a fidelity homotopy path from synthetic well-posed to real ill-posed sensing operators, yielding up to 2.5 dB PSNR gains.

  8. P-Flow: Proxy-gradient Flows for Linear Inverse Problems

    cs.LG 2026-05 unverdicted novelty 5.0

    P-Flow replaces direct differentiation through long flow paths with a proxy gradient update plus Gaussian spherical projection to stabilize reconstruction in linear inverse problems.

  9. Stabilizing RED using the Koopman Operator

    eess.IV 2025-09 conditional novelty 5.0

    A Koopman-operator-based monitor shrinks the RED step size whenever a low-dimensional model of the iterates predicts divergence, preventing PSNR collapse.

  10. Learned iterative networks: An operator learning perspective

    eess.IV 2025-12 conditional novelty 3.0

    Learned iterative reconstruction networks can be uniformly described as operator learning: the unrolled architecture fixes how to compute while the loss and data fix what to compute; for nonlinear inverse problems the...