← Back to all news
arXiv Machine Learning By Sean Gunn, Jorio Cocola, Oliver De Candido, Vaggos Chatziafratis, Paul Hand

Tunable Latent Generative Priors for Compressed Sensing and Inverse Problems

Read the original on arXiv Machine Learning →

The paper introduces tunable latent priors for diffusion models, normalizing flows, and variational autoencoders using nested dropout. These priors allow the latent dimensionality to adapt to each inverse problem, reducing reconstruction errors compared to fixed-complexity models across tasks such as compressed sensing, inpainting, denoising, and phase retrieval. In linear denoising, the authors derive the optimal latent complexity in closed form, linking it to noise level and signal spectrum.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 3

Full-Model Optimality for Tunable Linear Generative Priors in Compressed Sensing

The paper investigates compressed sensing using a family of tunable linear generative priors linked through their singular value decompositions. It proves that in noiseless Gaussian compressed sensing, the full-dimensional linear prior yields the lowest expected reconstruction error across the entire family, meaning lower-complexity priors do not improve performance in this idealized setting. This contrasts with denoising, where lower complexity priors can reduce error due to bias‑variance tradeoffs, suggesting that the experimental gains seen with neural network priors stem from their nonlinearities.

By Zhaoming Li, Paul Hand
safety
More like this →
arXiv Machine Learning
Oct 3

Trajectory Stitching for Solving Inverse Problems with Flow-Based Models

The paper introduces MS-Flow, a method that represents a flow-based generative model’s trajectory as a sequence of intermediate latent states instead of a single initial code. By enforcing local flow dynamics and coupling trajectory segments with matching penalties, the approach alternates between updating latent states and ensuring consistency with observed data. This strategy reduces memory usage and improves reconstruction quality on tasks such as image inpainting, super‑resolution, and computed tomography.

By Alexander Denker, Zeljko Kereta, Carola-Bibiane Sch\"onlieb, Moshe Eliasof
More like this →