Deep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations

• URL: http://arxiv.org/abs/2512.23829v1
• Date: Mon, 29 Dec 2025 19:50:55 GMT
• Title: Deep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations
• Authors: Oluwatosin Akande, Gabriel P. Langlois, Akwum Onwunta,
• Abstract summary: Inverse problems are important mathematical problems that seek to recover model parameters from noisy data.<n>We propose to leverage connections between proximal operators and neural partial differential equations (HJDEs) to develop novel deep learning architectures for learning the prior.
• Score: 0.8749675983608171
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 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.

Related papers

• Efficient Parametric SVD of Koopman Operator for Stochastic Dynamical Systems [51.54065545849027]
  The Koopman operator provides a principled framework for analyzing nonlinear dynamical systems.<n>VAMPnet and DPNet have been proposed to learn the leading singular subspaces of the Koopman operator.<n>We propose a scalable and conceptually simple method for learning the top-$k$ singular functions of the Koopman operator.
  arXiv  Detail & Related papers  (2025-07-09T18:55:48Z)
• Data-driven approaches to inverse problems [12.614421935598317]
  Inverse problems serve as critical tools for visualizing internal structures beyond what is visible to the naked eye.<n>A more recent paradigm considers deriving solutions to inverse problems in a data-driven manner.<n>These notes offer an introduction to this data-driven paradigm for inverse problems.
  arXiv  Detail & Related papers  (2025-06-13T12:44:32Z)
• Integrated utilization of equations and small dataset in the Koopman operator: applications to forward and inverse problems [0.0]
  This paper yields methods for incorporating ambiguous prior knowledge into the EDMD algorithm.<n>The ambiguous prior knowledge corresponds to the underlying time-evolution equations with unknown parameters.<n>We propose a scheme to apply the proposed method to inverse problems.
  arXiv  Detail & Related papers  (2025-03-26T23:45:06Z)
• PICL: Physics Informed Contrastive Learning for Partial Differential Equations [7.136205674624813]
  We develop a novel contrastive pretraining framework that improves neural operator generalization across multiple governing equations simultaneously. A combination of physics-informed system evolution and latent-space model output are anchored to input data and used in our distance function. We find that physics-informed contrastive pretraining improves accuracy for the Fourier Neural Operator in fixed-future and autoregressive rollout tasks for the 1D and 2D Heat, Burgers', and linear advection equations.
  arXiv  Detail & Related papers  (2024-01-29T17:32:22Z)
• Single-Shot Plug-and-Play Methods for Inverse Problems [24.48841512811108]
  Plug-and-Play priors in inverse problems have become increasingly prominent in recent years. Existing models predominantly rely on pre-trained denoisers using large datasets. In this work, we introduce Single-Shot perturbative methods, shifting the focus to solving inverse problems with minimal data.
  arXiv  Detail & Related papers  (2023-11-22T20:31:33Z)
• Learning to Optimize Permutation Flow Shop Scheduling via Graph-based Imitation Learning [70.65666982566655]
  Permutation flow shop scheduling (PFSS) is widely used in manufacturing systems. We propose to train the model via expert-driven imitation learning, which accelerates convergence more stably and accurately. Our model's network parameters are reduced to only 37% of theirs, and the solution gap of our model towards the expert solutions decreases from 6.8% to 1.3% on average.
  arXiv  Detail & Related papers  (2022-10-31T09:46:26Z)
• Neural Improvement Heuristics for Graph Combinatorial Optimization Problems [49.85111302670361]
  We introduce a novel Neural Improvement (NI) model capable of handling graph-based problems where information is encoded in the nodes, edges, or both. The presented model serves as a fundamental component for hill-climbing-based algorithms that guide the selection of neighborhood operations for each.
  arXiv  Detail & Related papers  (2022-06-01T10:35:29Z)
• Deep Equilibrium Assisted Block Sparse Coding of Inter-dependent Signals: Application to Hyperspectral Imaging [71.57324258813675]
  A dataset of inter-dependent signals is defined as a matrix whose columns demonstrate strong dependencies. A neural network is employed to act as structure prior and reveal the underlying signal interdependencies. Deep unrolling and Deep equilibrium based algorithms are developed, forming highly interpretable and concise deep-learning-based architectures.
  arXiv  Detail & Related papers  (2022-03-29T21:00:39Z)
• Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning [65.54757265434465]
  Pairwise learning refers to learning tasks where the loss function depends on a pair instances. Online descent (OGD) is a popular approach to handle streaming data in pairwise learning. In this paper, we propose simple and online descent to methods for pairwise learning.
  arXiv  Detail & Related papers  (2021-11-23T18:10:48Z)
• Fourier Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  We formulate a new neural operator by parameterizing the integral kernel directly in Fourier space. We perform experiments on Burgers' equation, Darcy flow, and Navier-Stokes equation. It is up to three orders of magnitude faster compared to traditional PDE solvers.
  arXiv  Detail & Related papers  (2020-10-18T00:34:21Z)
• Model-Aware Regularization For Learning Approaches To Inverse Problems [11.314492463814817]
  We provide an analysis of the generalisation error of deep learning methods applicable to inverse problems. We propose a 'plug-and-play' regulariser that leverages the knowledge of the forward map to improve the generalization of the network. We demonstrate the efficacy of our model-aware regularised deep learning algorithms against other state-of-the-art approaches.
  arXiv  Detail & Related papers  (2020-06-18T21:59:03Z)
• Communication-Efficient Distributed Stochastic AUC Maximization with Deep Neural Networks [50.42141893913188]
  We study a distributed variable for large-scale AUC for a neural network as with a deep neural network. Our model requires a much less number of communication rounds and still a number of communication rounds in theory. Our experiments on several datasets show the effectiveness of our theory and also confirm our theory.
  arXiv  Detail & Related papers  (2020-05-05T18:08:23Z)

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.