An Over Complete Deep Learning Method for Inverse Problems

• URL: http://arxiv.org/abs/2402.04653v1
• Date: Wed, 7 Feb 2024 08:38:12 GMT
• Title: An Over Complete Deep Learning Method for Inverse Problems
• Authors: Moshe Eliasof, Eldad Haber, Eran Treister
• Abstract summary: We show that machine learning techniques can face challenges when applied to some exemplary problems. We show that similar to previous works on over-complete dictionaries, it is possible to overcome these shortcomings by embedding the solution into higher dimensions. We demonstrate the merit of this approach on several exemplary and common inverse problems.
• Score: 15.919986945096182
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Obtaining meaningful solutions for inverse problems has been a major challenge with many applications in science and engineering. Recent machine learning techniques based on proximal and diffusion-based methods have shown promising results. However, as we show in this work, they can also face challenges when applied to some exemplary problems. We show that similar to previous works on over-complete dictionaries, it is possible to overcome these shortcomings by embedding the solution into higher dimensions. The novelty of the work proposed is that we jointly design and learn the embedding and the regularizer for the embedding vector. We demonstrate the merit of this approach on several exemplary and common inverse problems.

Related papers

• A Survey on Diffusion Models for Inverse Problems [110.6628926886398]
  We provide an overview of methods that utilize pre-trained diffusion models to solve inverse problems without requiring further training. We discuss specific challenges and potential solutions associated with using latent diffusion models for inverse problems.
  arXiv  Detail & Related papers  (2024-09-30T17:34:01Z)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• Exploring the solution space of linear inverse problems with GAN latent geometry [23.779985842891705]
  Inverse problems consist in reconstructing signals from incomplete sets of measurements. We propose a method to generate multiple reconstructions that fit both the measurements and a data-driven prior learned by a generative adversarial network.
  arXiv  Detail & Related papers  (2022-07-01T14:33:44Z)
• Theoretical Perspectives on Deep Learning Methods in Inverse Problems [115.93934028666845]
  We focus on generative priors, untrained neural network priors, and unfolding algorithms. In addition to summarizing existing results in these topics, we highlight several ongoing challenges and open problems.
  arXiv  Detail & Related papers  (2022-06-29T02:37:50Z)
• Accelerating numerical methods by gradient-based meta-solving [15.90188271828615]
  In science and engineering applications, it is often required to solve similar computational problems repeatedly. We propose a gradient-based algorithm to solve them in a unified way. We demonstrate the performance and versatility of our method through theoretical analysis and numerical experiments.
  arXiv  Detail & Related papers  (2022-06-17T07:31:18Z)
• Improving Diffusion Models for Inverse Problems using Manifold Constraints [55.91148172752894]
  We show that current solvers throw the sample path off the data manifold, and hence the error accumulates. To address this, we propose an additional correction term inspired by the manifold constraint. We show that our method is superior to the previous methods both theoretically and empirically.
  arXiv  Detail & Related papers  (2022-06-02T09:06:10Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Benchmarking deep inverse models over time, and the neural-adjoint method [3.4376560669160394]
  We consider the task of solving generic inverse problems, where one wishes to determine the hidden parameters of a natural system. We conceptualize these models as different schemes for efficiently, but randomly, exploring the space of possible inverse solutions. We compare several state-of-the-art inverse modeling approaches on four benchmark tasks.
  arXiv  Detail & Related papers  (2020-09-27T18:32:06Z)
• Regularization of Inverse Problems by Neural Networks [0.0]
  Inverse problems arise in a variety of imaging applications including computed tomography, non-destructive testing, and remote sensing. The characteristic features of inverse problems are the non-uniqueness and instability of their solutions. Deep learning techniques and neural networks demonstrated to significantly outperform classical solution methods for inverse problems.
  arXiv  Detail & Related papers  (2020-06-06T20:49:12Z)
• Deep Learning Techniques for Inverse Problems in Imaging [102.30524824234264]
  Recent work in machine learning shows that deep neural networks can be used to solve a wide variety of inverse problems. We present a taxonomy that can be used to categorize different problems and reconstruction methods.
  arXiv  Detail & Related papers  (2020-05-12T18:35:55Z)
• Inverse Problems, Deep Learning, and Symmetry Breaking [6.54545059421233]
  In many physical systems, inputs related by intrinsic system symmetries are mapped to the same output. We show that careful symmetry breaking on the training data can help get rid of the difficulties and significantly improve the learning performance.
  arXiv  Detail & Related papers  (2020-03-20T02:43:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.