Tunable Latent Generative Priors for Compressed Sensing and Inverse Problems

arXiv:2603.07357 · cs.LG, cs.AI · Submitted 2026-03-07 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-03-07

Updated: 2026-09-11

Code: https://github.com/huggingface/diffusers

License: http://creativecommons.org/licenses/by/4.0/

The gist: Latent generative models have emerged as powerful priors for solving inverse problems.

Terminology

Abstract

Latent generative models have emerged as powerful priors for solving inverse problems. These models typically represent a class of natural signals at a single, fixed complexity, governed by the latent dimensionality. This can be limiting: depending on the problem, a latent dimensionality that is too small may result in high representation error, while one that is too large may overfit to noise. We develop tunable latent priors for diffusion models, normalizing flows, and variational autoencoders, leveraging nested dropout. Across tasks including compressed sensing, inpainting, denoising, and phase retrieval, we show empirically that tunable priors consistently achieve lower reconstruction errors than fixed-complexity baselines. In the linear denoising setting, we derive the optimal complexity in closed form, showing how it depends on the noise level and the signal spectrum. This work demonstrates the potential of tunable latent generative priors and motivates both the development of supporting theory and their application across a wide range of inverse problems.

Sources

Related papers