Solving ill-conditioned polynomial equations using score-based priors with application to multi-target detection
Abstract
Recovering signals from low-order moments is a fundamental yet notoriously difficult task in inverse problems. This recovery process often reduces to solving ill-conditioned systems of polynomial equations. In this work, we propose a new framework that integrates score-based diffusion priors with moment-based estimators to regularize and solve these nonlinear inverse problems. This introduces a new role for generative models: stabilizing polynomial recovery from noisy statistical features. As a concrete application, we study the multi-target detection (MTD) model in the high-noise regime. We demonstrate two main results: (i) diffusion priors substantially improve recovery from third-order moments, and (ii) they make the super-resolution MTD problem, otherwise ill-posed, feasible. Numerical experiments on MNIST data confirm consistent gains in reconstruction accuracy across SNR levels. Our results suggest a promising new direction for combining generative priors with nonlinear polynomial inverse problems.
Keywords
Cite
@article{arxiv.2509.11397,
title = {Solving ill-conditioned polynomial equations using score-based priors with application to multi-target detection},
author = {Rafi Beinhorn and Shay Kreymer and Amnon Balanov and Michael Cohen and Alon Zabatani and Tamir Bendory},
journal= {arXiv preprint arXiv:2509.11397},
year = {2025}
}