Nonasymptotic Convergence Rates for Plug-and-Play Methods With MMSE Denoisers

arXiv:2510.27211 · math.OC, eess.SP, stat.ML · Submitted 2025-10-31 · Read on arXiv

math.OC, eess.SP, stat.ML

Submitted: 2025-10-31

Updated: 2026-06-15

Code: https://github.com/sparsity-group/pnpmmse

Terminology

• Inverse Problem — 15× in this paper · explained in 2 episodes
• Fidelity — 13× in this paper · explained in 2 episodes
• Regularization — 8× in this paper · explained in 3 episodes
• Convergence Guarantees — 4× in this paper · explained in 3 episodes
• Adam — 3× in this paper · explained in 2 episodes
• Objective Function — 3× in this paper · explained in 2 episodes
• Sparsity — 3× in this paper · explained in 4 episodes
• Activation Function — 1× in this paper · explained in 1 episode
• Generative Model — 1× in this paper · explained in 2 episodes
• Generative Models — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Interpretability — 1× in this paper · explained in 15 episodes
• Parsimony — 1× in this paper · explained in 2 episodes
• Score Function — 1× in this paper · explained in 4 episodes
• Selection Bias — 1× in this paper · explained in 4 episodes

Sources

• Image Restoration Using Convolutional Auto-encoders with Symmetric Skip Connections
• Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification