Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.33087

Plug-and-Play Methods Provably Converge Even with Improperly Trained Denoisers: Convergence by Architectural Design

Henry Pritchard·Rahul Parhi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Plug-and-Play (PnP) methods replace proximal operators with learned denoisers, which produce state-of-the-art reconstruction quality, but sacrifice the variational interpretation and convergence guarantees of proximal methods. Learned Proximal Networks (LPNs) address this problem by designing the denoiser architecture so that it is exactly the proximal operator of a regularizer. In this work, we clarify the theoretical foundations of LPNs and extend the framework to a broader class of activation functions. We then study two practical mechanisms for controlling the learned prior: (i) averaging the LPN with the identity, a common heuristic in PnP methods, and (ii) directly scaling the implicit regularizer induced by the proximal operator. In particular, we characterize the regularizer induced by averaging and develop a convergent method for evaluating the scaled proximal operator.

Explore related subjects

math.OCeess.SPstat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Henry Pritchard, Rahul Parhi. 2026-09-27. Plug-and-Play Methods Provably Converge Even with Improperly Trained Denoisers: Convergence by Architectural Design. https://arxiv.org/abs/2609.33087

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Single-loop Stochastic Riemannian ADMM for Nonsmooth Composite Optimization

We study a class of nonsmooth composite stochastic optimization on Riemannian manifolds, where the objective is the sum of an expectation function and a nonsmooth regularizer. These types of problems appear widely in various application fields, such as machine learning. Although operator-splitting methods naturally exploit this separable structure, existing Riemannian variants primarily target deterministic problems, and stochastic extensions are limited to more restrictive settings. In this work, we propose a momentum-based adaptive Riemannian stochastic alternating direction method of multipliers (MARS-ADMM), which combines a recursive variance-reduced estimator for the expectation component with a prediction-correction update for the nonsmooth block. This yields a single-loop algorithm requiring only two proximal updates, one Riemannian gradient evaluation, and $\mathcal{O}(1)$ stochastic gradient samples per iteration. Under standard assumptions, we prove that MARS-ADMM attains an $ε$-KKT point with an oracle complexity of $\mathcal{O}(ε^{-3})$, improving upon the previously best-known rate of $\widetilde{\mathcal{O}}(ε^{-3.5})$ for stochastic Riemannian primal-dual methods. This complexity also matches the best-known bounds in deterministic nonsmooth Riemannian optimization, demonstrating that deterministic-level accuracy can be achieved using only constant-size stochastic samples. Numerical experiments on two types of test problems reveal promising performances of the proposed algorithm. To the best of our knowledge, MARS-ADMM is the first stochastic Riemannian ADMM with provable optimal complexity guarantees.

math.OC↗
arXiv2026

Convergence analysis of dynamical systems for optimization by an improved Lyapunov framework

We study the convergence analysis of continuous-time dynamical systems associated with optimization methods for strongly convex functions. Recent works have proposed systematic constructions of Lyapunov functions for such analysis, while also revealing limitations of the Lyapunov analysis. Aujol--Dossal--Rondepierre (2023) have proposed a technique to address this issue by reorganizing Lyapunov functions so as to evaluate a quantity $f(x(t)) - f_* - g(t)\|x(t)-x_*\|^2$ rather than $f(x(t)) - f_*$. By combining this technique with our computer-assisted framework to discover Lyapunov functions, we develop an improved method that reproduces an existing convergence rate or yields better rates than previous studies.

math.OC↗
arXiv2026

Mean Field Games and Control on Large Expander Graphs

This paper investigates mean field games on sparse networks. In the case of large expander graphs, the limit topologies are analyzed using the graphexon framework, which characterizes sparse connections. We prove that the associated sequence of discrete averaging operators converges strongly to a continuous operator and this is illustrated in the development of infinite limits of Gabber-Galil-Margulis expander graphs \cite{gabber1981explicit}. These properties enable the formulation and existence proof of equilibria for linear-quadratic mean field games in which each agent is identified by a spatial network label $α\in X$ and only interacts with the neighborhood average characterized by the operator $\mathcal{G}$, i.e., the average state of a limited number of connected neighbors in a large expander graph. Furthermore, algebraic conditions induced by the spectral gap of $\mathcal{G}$ for the global asymptotic stability of the closed-loop system are established, and parameter thresholds that give rise to a Turing-type topological instability are established.

math.OC↗