arXiv Machine Learning By Stanislas Ducotterd, Zhiyuan Hu, Michael Unser, Jonathan Dong

Breaking the Weak Recovery Limit in Random Phase Retrieval with Learned Regularizers

Read the original on arXiv Machine Learning →

arXiv:2509. 15026v2 Announce Type: replace-cross Abstract: We seek to recover an unknown signal from nonlinear amplitude-only measurements, a challenging inverse problem.

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.

arXiv Machine Learning
Jun 8

On the conditional equivalence of phase retrieval algorithms

arXiv:2606. 07257v1 Announce Type: cross Abstract: Phase retrieval - recovering a complex-valued field from intensity measurements - is typically solved using variants of the Gerchberg-Saxton (GS) algorithm, understood as alternating projections between measurement planes.

By Jakob Schroeder, Andreas D\"opp
Hugging Face Trending Papers
Jun 30

MG-SpaIR: Multi-grade Sparse-guided Implicit Representation for Training-Data-Free Image Restoration

MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade coarse-to-fine residual hierarchy that progressively refines the reconstruction across resolution grades, improving representational fidelity and mitigating spectral limitations.

arXiv Machine Learning
Sep 14

Tunable Latent Generative Priors for Compressed Sensing and Inverse Problems

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.

By Sean Gunn, Jorio Cocola, Oliver De Candido, Vaggos Chatziafratis, Paul Hand
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