---
title: Deep Pseudo Contractive Denoisers
url: https://www.emergentmind.com/topics/deep-pseudo-contractive-denoisers
type: topic
---

# Deep Pseudo Contractive Denoisers

Deep pseudo contractive denoisers are a class of deep neural-network-based denoising operators designed to satisfy relaxed contraction-like properties, thereby supporting provable and stable integration in iterative signal recovery methods while retaining strong empirical denoising power. The concept emerges at the intersection of plug-and-play (PnP) optimization, monotone operator theory, and modern deep learning, aiming to bridge the gap between robust theoretical guarantees and the empirical effectiveness characteristic of deep image restoration networks.

## 1. Theoretical Formulation and Operator Properties

A deep pseudo contractive denoiser is formally defined by its operator-level regularity. Given a denoising operator $D$, pseudo contractiveness requires (for a constant $k<1$)
$$
\|D(x) - D(y)\|^2 \leq \|x-y\|^2 + k\|(I - D)(x) - (I - D)(y)\|^2
$$
for all $x,y$ in an appropriate Hilbert space. This condition is a relaxation of non-expansiveness, which would require simply $\|D(x) - D(y)\| \leq \|x-y\|$, and of firm non-expansiveness and averagedness, both of which are classical regularity assumptions linking denoisers to proximal mappings.

Spectral analysis of the Jacobian $J(x)$ of $D$ reveals that pseudo contractiveness is substantially weaker than (firm) non-expansiveness. The requirement, written in spectral terms, stipulates that all eigenvalues of the symmetric part $S = (J + J^T)/2$ satisfy $\operatorname{Re}(z) \leq 1$ rather than being confined to the unit disk. For strict pseudo contractiveness ($k < 1$), an equivalent operator decomposition exists: $D$ can be written as a convex combination of a non-expansive operator and the identity, i.e.
$$
D = \frac{1}{1-k}N - \frac{k}{1-k}I
$$
for some non-expansive $N$.

## 2. Training Methodologies and Regularization

Enforcing pseudo contractiveness in deep denoiser training involves regularizing the Jacobian's spectrum or functionals of its symmetric part. A representative training objective is
$$
\mathbb{E}_{x,\xi}\|D_\beta(x + \xi; \theta) - x\|^2 + r \,\cdot\, \text{penalty}(J)
$$
where $\text{penalty}(J)$ promotes the spectral constraint $\|kI + (1 - k)J\|_* \leq 1$, or alternatively, enforces a bound on a holomorphic functional calculus such as $f(S) = S/(S-2)$, ensuring $\|f(S)\|_* \leq 1$. These constraints can be approximated practically with power iteration and automatic differentiation.

This regularization avoids the performance degradation typical when enforcing non-expansiveness or contractivity too strictly. Experiments show pseudo contractive denoisers (e.g., PC-DRUNet, SPC-DRUNet) achieve competitive peak SNR, often with only a minor tradeoff relative to unconstrained denoisers, while gaining provable convergence properties in PnP inverse problem settings [2402.05637].

## 3. Integration into Iterative and Plug-and-Play Schemes

Deep pseudo contractive denoisers enable stable integration into complex iterative signal estimation and inverse-problem solvers. The underlying theoretical guarantee is that for a denoiser $D_\beta$ satisfying $k$-strict pseudo contractiveness ($k < 1$), fixed-point iterations based on the Ishikawa process (a generalization of Krasnosel’skii–Mann) globally converge:
```latex
v^n = (1 - \beta_n)u^n + \beta_n (D_\beta(u^n) - \nabla G(u^n))
u^{n+1} = (1 - \alpha_n)u^n + \alpha_n (D_\beta(v^n) - \nabla G(v^n))
```
for sequences $\{\alpha_n\}, \{\beta_n\}$, with $\sum \alpha_n \beta_n = \infty$ and $\beta_n \to 0$. This extends to plug-and-play methods based on half-quadratic splitting, forward-backward splitting, and Davis–Yin splitting schemes: in each, convergence can be shown under the relatively weak pseudo contractive (or cocoercive) condition [2402.05637, 2510.12425].

Conservativeness (i.e., the denoiser being the gradient of a scalar potential) further allows identification of the denoiser as the proximal operator of a possibly nonconvex, weakly convex function, reinforcing the fixed-point interpretation of the resulting algorithms [2505.08909].

## 4. Practical Architectures, Empirical Calibration, and Extensions

Pseudo contractive properties can be embedded in both standard CNN denoisers (e.g., DRUNet, DnCNN) through spectral norm, Jacobian penalty, or holomorphic functional regularization; and in specialized architectures derived by deep-unfolding of contractive/averaged operators (for instance, via unrolled wavelet-thresholding or conjugate-gradient iterations [2207.07321, 2409.06676]). The deployment strategy depends on the precise reconstruction task and regularization requirements:

- **General nonlinear denoisers**: Spectral or functional regularization imposed directly at training time, no significant architecture constraint [2402.05637].
- **Unfolded/structured denoisers**: Deep-unrolling of classical contractive schemes (e.g., wavelet or Laplacian regularized filters) ensures explicit averagedness/contractivity by architectural design [2207.07321, 2409.06676].
- **Conservative denoisers**: Addition of Hamiltonian regularization to drive the Jacobian towards symmetry, making the operator a gradient field [2505.08909].

Pseudo contractive denoisers generalize to tensor completion, multi-modal inpainting, deblurring, super-resolution, Poisson inverse problems, video and hyperspectral image recovery, and are robust to both finite-alphabet discrete data and real-valued noisy measurements [2510.12425, 2402.05637, 2505.08909]. Experimental results in these domains consistently demonstrate that DPC denoisers deliver superior restoration quality at low sampling rates and in challenging noise regimes.

## 5. Comparison and Relationship to Other Regularity Criteria

Pseudo contractiveness sits in a natural hierarchy:
- **Firmly non-expansive** ⊂ **Averaged** ⊂ **Non-expansive** ⊂ **Pseudo contractive**
- **Cocoercive conservative denoisers** generalize further, allowing Jacobians with spectrum outside the unit disk if the operator remains the gradient of a weakly convex potential [2505.08909].

Whereas standard non-expansive (or 1-Lipschitz) constraints can be too strong and empirically degrade denoising, pseudo contractiveness retains empirical denoising efficacy while allowing for convergence analysis in monotone-operator-based splitting, PnP, and half-quadratic frameworks. Compared to kernel denoisers, which are linear and analytically contractive in specialized norms [2505.15318], deep pseudo contractive denoisers permit much richer, data-adaptive regularization.

## 6. Performance, Applications, and Future Directions

The empirical evidence supports the utility of deep pseudo contractive denoisers in high-dimensional inverse problems:
- **Quantitative results**: PnP methods with DPC denoisers consistently achieve strong PSNR/MSSIM on benchmarks, with marginal (<0.2–0.5 dB) loss relative to unconstrained denoisers but with global algorithm convergence [2402.05637, 2510.12425].
- **Imaging applications**: Dense and structured tensor completion, non-Gaussian denoising, low-sampling video recovery, spatio-temporal traffic imputation.
- **Robustness**: DPC denoisers exhibit resilience to noise model mismatch, sampling artifacts, and covariate shift [2409.06676].

Future work includes tighter integration of denoiser contractivity constraints with self-supervised or unsupervised denoising (e.g., SURE/eSURE, pseudo-label, or partial-linearity strategies), extensibility to non-commutative operator frameworks and learning in non-Hilbertian geometries, as well as refined holomorphic or functional calculus constraints for even greater theoretical flexibility.

## 7. Summary Table: Operator Regularity Classes for Denoisers

| Regularity Class          | Mathematical Criterion                                                               | Empirical Impact            |
|--------------------------|--------------------------------------------------------------------------------------|-----------------------------|
| Firmly Non-expansive     | $\|D(x) - D(y)\|^2 \leq \langle D(x) - D(y), x - y \rangle$                          | Strongest guarantee, limits denoising power |
| Averaged (α-averaged)    | $D = (1-\alpha)I + \alpha N$, $N$ non-expansive, $\alpha \in (0,1)$                  | Good guarantee, moderately strict |
| Non-expansive            | $\|D(x) - D(y)\| \leq \|x - y\|$                                                     | Standard criterion, restricts capacity |
| Pseudo Contractive (k)   | $\|D(x) - D(y)\|^2 \leq \|x - y\|^2 + k\|(I-D)(x)-(I-D)(y)\|^2$, $k < 1$             | Weakest, supports convergence and effective denoising |
| Cocoercive Conservative  | $\langle x-y, D(x)-D(y) \rangle \geq \gamma\|D(x)-D(y)\|^2$, $D=\nabla\phi$          | Allows residual expansion, preserves strong denoising [2505.08909] |

In conclusion, deep pseudo contractive denoisers constitute a flexible, theoretically justified approach for integrating deep learning–based denoisers with modern monotone splitting and inverse-problem solvers. They achieve a balance between empirical performance and global algorithmic convergence across diverse image, video, and tensor recovery tasks, enabling next-generation plug-and-play and regularization-by-denoising methods to blend the strengths of deep learning with operator-theoretic rigor.

Source: https://www.emergentmind.com/topics/deep-pseudo-contractive-denoisers