@inproceedings{
fang2023whats,
title={What{\textquoteright}s in a Prior? Learned Proximal Networks for Inverse Problems},
author={Zhenghan Fang and Sam Buchanan and Jeremias Sulam},
booktitle={NeurIPS 2023 Workshop on Deep Learning and Inverse Problems},
year={2023},
url={https://openreview.net/forum?id=LIL1M2fdGb}
}
Proximal operators are ubiquitous in inverse problems, commonly appearing as part of algorithmic strategies to regularize problems that are otherwise ill-posed. Modern deep learning models have been brought to bear for these tasks too, as in the framework of plug-and-play or deep unrolling, where they loosely resemble proximal operators. Yet, something essential is lost in employing these purely data-driven approaches: there is no guarantee that a general deep network represents the proximal operator of any function, nor is there any characterization of the function for which the network might provide some approximate proximal. This not only makes guaranteeing convergence of iterative schemes challenging but, more fundamentally, complicates the analysis of what has been learned by these networks about their training data. Herein we provide a framework to develop learned proximal networks (LPN), prove that they provide exact proximal operators for a data-driven nonconvex regularizer, and show how a new training strategy, dubbed proximal matching, provably promotes the recovery of the log-prior of the true data distribution. Such LPN provide general, unsupervised, expressive proximal operators that can be used for general inverse problems with convergence guarantees. We illustrate our results in a series of cases of increasing complexity, demonstrating that these models not only result in state-of-the-art performance, but provide a window into the resulting priors learned from data.
What’s in a Prior? Learned Proximal Networks for Inverse Problems
Zhenghan Fang Sam Buchanan Jeremias Sulam