Local Geometry of Least Squares for Unmixing Signals with Parameter-Dependent Dictionaries
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910183644463104 |
|---|---|
| author | Michelena, Santos Da Costa, Maxime Ferreira Picheral, José |
| author_facet | Michelena, Santos Da Costa, Maxime Ferreira Picheral, José |
| contents | Modeling signals as linear combinations of atoms from a dictionary is ubiquitous in modern signal processing. In the finite-dimensional setting, whenever atoms depend nonlinearly upon unknown parameters, the signal model is said to be separable. In this work, we study least-squares reconstruction of separable signals and establish a unified theoretical framework for their analysis. We introduce the unmixing metric, a distance that captures the distinct roles and sensitivities of linear and nonlinear parameters, and establish local convergence and stability guarantees under its topology. We then analyze variable projection from a geometric perspective, showing that it corresponds to restricting the optimization to the manifold of optimal linear parameters. This viewpoint provides a principled explanation for the improved algorithmic behavior of variable projection observed in practice, and produces sharp theoretical guarantees. The generic theory for separable problems is specialized to the case of point spread function (PSF) unmixing. We introduce a parametric notion of coherence and show that support separation directly controls both the size of the convergence region and the stability of recovery. Numerical experiments corroborate the theoretical predictions and demonstrate the practical relevance of the proposed framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_00585 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Local Geometry of Least Squares for Unmixing Signals with Parameter-Dependent Dictionaries Michelena, Santos Da Costa, Maxime Ferreira Picheral, José Signal Processing Numerical Analysis Modeling signals as linear combinations of atoms from a dictionary is ubiquitous in modern signal processing. In the finite-dimensional setting, whenever atoms depend nonlinearly upon unknown parameters, the signal model is said to be separable. In this work, we study least-squares reconstruction of separable signals and establish a unified theoretical framework for their analysis. We introduce the unmixing metric, a distance that captures the distinct roles and sensitivities of linear and nonlinear parameters, and establish local convergence and stability guarantees under its topology. We then analyze variable projection from a geometric perspective, showing that it corresponds to restricting the optimization to the manifold of optimal linear parameters. This viewpoint provides a principled explanation for the improved algorithmic behavior of variable projection observed in practice, and produces sharp theoretical guarantees. The generic theory for separable problems is specialized to the case of point spread function (PSF) unmixing. We introduce a parametric notion of coherence and show that support separation directly controls both the size of the convergence region and the stability of recovery. Numerical experiments corroborate the theoretical predictions and demonstrate the practical relevance of the proposed framework. |
| title | Local Geometry of Least Squares for Unmixing Signals with Parameter-Dependent Dictionaries |
| topic | Signal Processing Numerical Analysis |
| url | https://arxiv.org/abs/2605.00585 |