Deep equilibrium models (DEQs) are implicit neural networks with fixed points that have recently gained attention for learning image regularization functionals, particularly in settings involving Gaussian fidelities, where assumptions on the forward operator ensure contractiveness of standard (proximal) gradient descent operators. In this work, we extend the application of DEQs to Poisson inverse problems, where the data fidelity term is more appropriately modeled by the Kullback-Leibler divergence. To this end, we introduce a novel DEQ formulation based on mirror descent defined in terms of a tailored non-Euclidean geometry that naturally adapts with the structure of the data term. This enables the learning of neural regularizers within a principled training framework. We derive sufficient conditions and establish refined convergence results based on the Kurdyka-Łojasiewicz framework for functions with nonclosed domains to guarantee the convergence of the learned re construction scheme and propose computational strategies that enable both efficient training and parameter-free inference. Numerical experiments show that our method outperforms traditional model-based approaches, and it is comparable to the performance of Bregman plug-and-play meth ods, while mitigating their typical drawbacks, such as time-consuming tuning of hyperparameters. The code is publicly available at https://github.com/christiandaniele/DEQ-MD.
Deep Equilibrium Models for Poisson Imaging Inverse Problems via Mirror Descent
Daniele, Christian;Villa, Silvia;Vaiter, Samuel;Calatroni, Luca
2026-01-01
Abstract
Deep equilibrium models (DEQs) are implicit neural networks with fixed points that have recently gained attention for learning image regularization functionals, particularly in settings involving Gaussian fidelities, where assumptions on the forward operator ensure contractiveness of standard (proximal) gradient descent operators. In this work, we extend the application of DEQs to Poisson inverse problems, where the data fidelity term is more appropriately modeled by the Kullback-Leibler divergence. To this end, we introduce a novel DEQ formulation based on mirror descent defined in terms of a tailored non-Euclidean geometry that naturally adapts with the structure of the data term. This enables the learning of neural regularizers within a principled training framework. We derive sufficient conditions and establish refined convergence results based on the Kurdyka-Łojasiewicz framework for functions with nonclosed domains to guarantee the convergence of the learned re construction scheme and propose computational strategies that enable both efficient training and parameter-free inference. Numerical experiments show that our method outperforms traditional model-based approaches, and it is comparable to the performance of Bregman plug-and-play meth ods, while mitigating their typical drawbacks, such as time-consuming tuning of hyperparameters. The code is publicly available at https://github.com/christiandaniele/DEQ-MD.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



