Tradeoffs Between Convergence Speed and Reconstruction Accuracy in Inverse Problems

DOI10.1109/TSP.2018.2791945MaRDI QIDQ4621684zbMATH OpenOpenAlexFDO

Authors Y. C. Eldar, Alex M. Bronstein, Guillermo Sapiro, Raja Giryes

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.09232

Mathematics Subject Classification ID

Inverse problems in optimal control (49N45) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Solving inverse problems with iterative algorithms is popular, especially for large data. Due to time constraints, the number of possible iterations is usually limited, potentially affecting the achievable accuracy. Given an error one is willing to tolerate, an important question is whether it is possible to modify the original iterations to obtain faster convergence to a minimizer achieving the allowed error without increasing the computational cost of each iteration considerably. Relying on recent recovery techniques developed for settings in which the desired signal belongs to some low-dimensional set, we show that using a coarse estimate of this set may lead to faster convergence at the cost of an additional reconstruction error related to the accuracy of the set approximation. Our theory ties to recent advances in sparse recovery, compressed sensing, and deep learning. Particularly, it may provide a possible explanation to the successful approximation of the l1-minimization solution by neural networks with layers representing iterations, as practiced in the learned iterative shrinkage-thresholding algorithm (LISTA).

Recommendations

• Conjugate gradient based acceleration for inverse problems
• Computationally efficient estimators for sequential and resolution-limited inverse problems
• On the acceleration of optimal regularization algorithms for linear ill-posed inverse problems
• Inverse problems with sparsity constraints: Convergence rates and exact recovery
• Sharp Time–Data Tradeoffs for Linear Inverse Problems
• Convergence rates and structure of solutions of inverse problems with imperfect forward models
• Fast realization algorithms for determining regularization parameters in linear inverse problems
• Convergence rates for the joint solution of inverse problems with compressed sensing data
• Convergence of a Reconstruction Method for the Inverse Conductivity Problem
• Fast convergence strategy for ambiguous inverse problems based on hierarchical regularization

Cited in

(8)

• Regularization by architecture: a deep prior approach for inverse problems
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• Convolutional neural networks analyzed via convolutional sparse coding
• Solving inverse problems using data-driven models
• An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee
• Fast convergence strategy for ambiguous inverse problems based on hierarchical regularization
• Learning to optimize: a tutorial for continuous and mixed-integer optimization
• Covariance constraints for stochastic inverse problems of computer models

This page was built for publication: Tradeoffs Between Convergence Speed and Reconstruction Accuracy in Inverse Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621684)