Multi-GPU distributed PnP-ULA for high-dimensional imaging inverse problems

Markov Chain Monte Carlo (MCMC) methods enable uncertainty quantification in inverse problems, making them valuable in various applications, especially when no ground-truth is available. Optimization-inspired Plug-and-Play MCMC algorithms, like PnP-ULA, have been developed to incorporate rich neural networks as priors, improving drastically the estimation quality. However, scaling MCMC samplers remains challenging, as generating and storing a sufficient number of high-dimensional samples, typically high-resolution images, can be computationally prohibitive. This work proposes a distributed implementation of PnP-ULA to target much larger problems without compromising on estimation quality. The proposed approach leverages a lightweight deep denoiser within a Single Program Multiple Data that permits an efficient exploitation of a multi-GPU architecture. Synthetic imaging tasks demonstrate the scalability and performance of this strategy to deal with very high dimensional inverse problems. This approach achieves competitive estimation quality along with uncertainty quantification compared to a typical state-of-the-art PnP optimization method, with much higher scalability.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/ssp64130.2025.11073314
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-GPU distributed PnP-ULA for high-dimensional imaging inverse problems

Pierre-Antoine Thouvenin, Audrey Repetti, Pierre Chainais, Maxime Bouton
Sparse and Compressive Sensing Techniques
article

Multi-GPU distributed PnP-ULA for high-dimensional imaging inverse problems

Pierre-Antoine Thouvenin, Audrey Repetti, Pierre Chainais, Maxime Bouton
article en

Abstract

Markov Chain Monte Carlo (MCMC) methods enable uncertainty quantification in inverse problems, making them valuable in various applications, especially when no ground-truth is available. Optimization-inspired Plug-and-Play MCMC algorithms, like PnP-ULA, have been developed to incorporate rich neural networks as priors, improving drastically the estimation quality. However, scaling MCMC samplers remains challenging, as generating and storing a sufficient number of high-dimensional samples, typically high-resolution images, can be computationally prohibitive. This work proposes a distributed implementation of PnP-ULA to target much larger problems without compromising on estimation quality. The proposed approach leverages a lightweight deep denoiser within a Single Program Multiple Data that permits an efficient exploitation of a multi-GPU architecture. Synthetic imaging tasks demonstrate the scalability and performance of this strategy to deal with very high dimensional inverse problems. This approach achieves competitive estimation quality along with uncertainty quantification compared to a typical state-of-the-art PnP optimization method, with much higher scalability.

Centre National de la Recherche Scientifique (FR), Université de Lille (FR), Heriot-Watt University (GB), École Centrale de Lille (FR)
Affordable and clean energy
Openalex Percentile: Top 79%
Sparse and Compressive Sensing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.