A calibrated inverse bound converts small finite-probe drift into a total-variation closeness certificate for distributions in a finite basis, with abstention when the observability margin is nonpositive.
Algebraic compressed sensing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We introduce the broad subclass of algebraic compressed sensing problems, where structured signals are modeled either explicitly or implicitly via polynomials. This includes, for instance, low-rank matrix and tensor recovery. We employ powerful techniques from algebraic geometry to study well-posedness of sufficiently general compressed sensing problems, including existence, local recoverability, global uniqueness, and local smoothness. Our main results are summarized in thirteen questions and answers in algebraic compressed sensing. Most of our answers concerning the minimum number of required measurements for existence, recoverability, and uniqueness of algebraic compressed sensing problems are optimal and depend only on the dimension of the model.
fields
stat.ML 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Finite-Probe Total-Variation Certificates for Finite-Basis Drifting Models
A calibrated inverse bound converts small finite-probe drift into a total-variation closeness certificate for distributions in a finite basis, with abstention when the observability margin is nonpositive.