On the Contractivity of Plug-and-Play Operators

• URL: http://arxiv.org/abs/2309.16899v3
• Date: Sun, 17 Dec 2023 02:19:57 GMT
• Title: On the Contractivity of Plug-and-Play Operators
• Authors: Chirayu D. Athalye, Kunal N. Chaudhury, and Bhartendu Kumar
• Abstract summary: In noise-and-play regularization, the operator in algorithms such as ISTA and ADM is replaced by a powerfulrr. This formal substitution works surprisingly well in practice. In fact,. has been shown to give state-of-the-art results for various imaging applications.
• Score: 11.218821754886514
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In plug-and-play (PnP) regularization, the proximal operator in algorithms such as ISTA and ADMM is replaced by a powerful denoiser. This formal substitution works surprisingly well in practice. In fact, PnP has been shown to give state-of-the-art results for various imaging applications. The empirical success of PnP has motivated researchers to understand its theoretical underpinnings and, in particular, its convergence. It was shown in prior work that for kernel denoisers such as the nonlocal means, PnP-ISTA provably converges under some strong assumptions on the forward model. The present work is motivated by the following questions: Can we relax the assumptions on the forward model? Can the convergence analysis be extended to PnP-ADMM? Can we estimate the convergence rate? In this letter, we resolve these questions using the contraction mapping theorem: (i) for symmetric denoisers, we show that (under mild conditions) PnP-ISTA and PnP-ADMM exhibit linear convergence; and (ii) for kernel denoisers, we show that PnP-ISTA and PnP-ADMM converge linearly for image inpainting. We validate our theoretical findings using reconstruction experiments.

Related papers

• Non-asymptotic bounds for forward processes in denoising diffusions: Ornstein-Uhlenbeck is hard to beat [49.1574468325115]
  This paper presents explicit non-asymptotic bounds on the forward diffusion error in total variation (TV) We parametrise multi-modal data distributions in terms of the distance $R$ to their furthest modes and consider forward diffusions with additive and multiplicative noise.
  arXiv  Detail & Related papers  (2024-08-25T10:28:31Z)
• Convergence of Nonconvex PnP-ADMM with MMSE Denoisers [8.034511587847158]
  Plug-and-Play Alternating Direction Method of Multipliers (ADMM) is widely-used for physical measurement problems. It has however been observed that. ADMM often empirically converges even for expansive CNNs.
  arXiv  Detail & Related papers  (2023-11-30T18:52:47Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• Prior Mismatch and Adaptation in PnP-ADMM with a Nonconvex Convergence Analysis [20.63188897629508]
  Plug-and-Play priors is a widely-used family methods for solving inverse imaging problems. Deep methods have been shown to achieve state-of-the-art performance when the prior is obtained using powerful denoisers.
  arXiv  Detail & Related papers  (2023-09-29T20:49:00Z)
• Modeling the space-time correlation of pulsed twin beams [68.8204255655161]
  Entangled twin-beams generated by parametric down-conversion are among the favorite sources for imaging-oriented applications. We propose a semi-analytic model which aims to bridge the gap between time-consuming numerical simulations and the unrealistic plane-wave pump theory.
  arXiv  Detail & Related papers  (2023-01-18T11:29:49Z)
• Optimality Guarantees for Particle Belief Approximation of POMDPs [55.83001584645448]
  Partially observable Markov decision processes (POMDPs) provide a flexible representation for real-world decision and control problems. POMDPs are notoriously difficult to solve, especially when the state and observation spaces are continuous or hybrid. We propose a theory characterizing the approximation error of the particle filtering techniques that these algorithms use.
  arXiv  Detail & Related papers  (2022-10-10T21:11:55Z)
• FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels [82.53569355337586]
  This work offers an efficient solution to temporal point processes inference using general parametric kernels with finite support. The method's effectiveness is evaluated by modeling the occurrence of stimuli-induced patterns from brain signals recorded with magnetoencephalography (MEG) Results show that the proposed approach leads to an improved estimation of pattern latency than the state-of-the-art.
  arXiv  Detail & Related papers  (2022-10-10T12:35:02Z)
• Proximal denoiser for convergent plug-and-play optimization with nonconvex regularization [7.0226402509856225]
  Plug-and-Play () methods solve ill proximal-posed inverse problems through algorithms by replacing a neural network operator by a denoising operator. We show that this denoiser actually correspond to a gradient function.
  arXiv  Detail & Related papers  (2022-01-31T14:05:20Z)
• On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent [13.168923974530307]
  Methods to solve imaging problems usually combine an explicit data likelihood function with a prior that explicitly expected properties of the solution. In a departure from explicit modelling, several recent works have proposed and studied the use of implicit priors defined by an image denoising algorithm.
  arXiv  Detail & Related papers  (2022-01-16T20:50:08Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Plug-and-play ISTA converges with kernel denoisers [21.361571421723262]
  Plug-and-play (blur) method is a recent paradigm for image regularization. A fundamental question in this regard is the theoretical convergence of the kernels.
  arXiv  Detail & Related papers  (2020-04-07T06:25:34Z)

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.