“sample complexity”

Jointly low-rank and bisparse recovery: Questions and partial answers

Abstract: We investigate the problem of recovering jointly $r$-rank and $s$-bisparse matrices from as few linear measurements as possible, considering arbitrary measurements as well as rank-one measurements. In both cases, we show that \(m ≍ r s łn(en/s)\) measurements make the recovery possible in theory, meaning via a nonpractical algorithm.

A non-convex blind calibration method for randomised sensing strategies

Abstract: The implementation of computational sensing strategies often faces calibration problems typically solved by means of multiple, accurately chosen training signals, an approach that can be resource-consuming and cumbersome. Conversely, blind calibration does not require any training, but corresponds to a bilinear inverse problem whose algorithmic solution is an open issue.