Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Akande, Oluwatosin, Langlois, Gabriel P., Onwunta, Akwum
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2512.23829
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914310159073280
author Akande, Oluwatosin
Langlois, Gabriel P.
Onwunta, Akwum
author_facet Akande, Oluwatosin
Langlois, Gabriel P.
Onwunta, Akwum
contents Inverse problems are important mathematical problems that seek to recover model parameters from noisy data. Since inverse problems are often ill-posed, they require regularization or incorporation of prior information about the underlying model or unknown variables. Proximal operators, ubiquitous in nonsmooth optimization, are central to this because they provide a flexible and convenient way to encode priors and build efficient iterative algorithms. They have also recently become key to modern machine learning methods, e.g., for plug-and-play methods for learned denoisers and deep neural architectures for learning priors of proximal operators. The latter was developed partly due to recent work characterizing proximal operators of nonconvex priors as subdifferential of convex potentials. In this work, we propose to leverage connections between proximal operators and Hamilton-Jacobi partial differential equations (HJ PDEs) to develop novel deep learning architectures for learning the prior. In contrast to other existing methods, we learn the prior directly without recourse to inverting the prior after training. We present several numerical results that demonstrate the efficiency of the proposed method in high dimensions.
format Preprint
id arxiv_https___arxiv_org_abs_2512_23829
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Deep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations
Akande, Oluwatosin
Langlois, Gabriel P.
Onwunta, Akwum
Numerical Analysis
Machine Learning
Inverse problems are important mathematical problems that seek to recover model parameters from noisy data. Since inverse problems are often ill-posed, they require regularization or incorporation of prior information about the underlying model or unknown variables. Proximal operators, ubiquitous in nonsmooth optimization, are central to this because they provide a flexible and convenient way to encode priors and build efficient iterative algorithms. They have also recently become key to modern machine learning methods, e.g., for plug-and-play methods for learned denoisers and deep neural architectures for learning priors of proximal operators. The latter was developed partly due to recent work characterizing proximal operators of nonconvex priors as subdifferential of convex potentials. In this work, we propose to leverage connections between proximal operators and Hamilton-Jacobi partial differential equations (HJ PDEs) to develop novel deep learning architectures for learning the prior. In contrast to other existing methods, we learn the prior directly without recourse to inverting the prior after training. We present several numerical results that demonstrate the efficiency of the proposed method in high dimensions.
title Deep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations
topic Numerical Analysis
Machine Learning
url https://arxiv.org/abs/2512.23829