DogRot: Taming Highly Ill-Conditioned Sensing Matrix in Sparse Signal Recovery by Random Gaussian Rotator

18 Sept 2025 (modified: 11 Feb 2026)Submitted to ICLR 2026EveryoneRevisionsBibTeXCC BY 4.0
Keywords: sparse signal recovery, compressed sensing, sensing matrix preconditioning, random Gaussian rotator
Abstract: Recovering sparse signal from an undetermined system, known as compressing sensing (CS), has been a topic with longstanding interests in many signal processing and machine learning applications. A sensing matrix with low inter-column coherence is fundamental to the identifiability of CS. In many real-world problems (e.g., magnetic resonance imaging reconstruction and genetic disease classification) however, relative sensing matrices could be extremely `fat', and naturally contain many proportional columns. Solving the resultant CS problems is notoriously fragile. This work aims to address a family of CS problems induced by such ill-conditioned sensing matrices. We propose DogRot, a plug-and-play preconditioner constructed from a designated diagonal-dominant Gaussian random rotator. Intuitively, DogRot reshapes the sensing matrix to lower its mutual coherence while preserving the sparse solution set, thereby strengthening identifiability. We rigorously establish these properties in theory and validate them extensively in practice. As a lightweight and easily integrable preconditioner, DogRot can be seamlessly combined with existing sparse recovery algorithms. Across diverse applications, our experiments show that DogRot consistently reduces mutual coherence and effectively improves the quality of sparse signal recovery.
Primary Area: other topics in machine learning (i.e., none of the above)
Submission Number: 11102
Loading