Restricted Isometry Property on Banded Block Toeplitz Matrices with Application to Multi-Channel Convolutive Source Separation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In compressive sensing (CS), the restricted isometry property (RIP) is an important condition on measurement matrices which guarantees the recovery of sparse signals with undersampled measurements. It has been proved in the prior works that both random (e.g., i.i.d. Gaussian, Bernoulli, ...) and Toeplitz matrices satisfy the RIP with high probability. However, structured matrices, such as banded Toeplitz matrices have drawn more attention since their structures have the advantage of fast matrix multiplication which may decrease the computational complexity of recovery algorithms. In this paper, we show that banded block Toeplitz matrices satisfy the RIP condition with high probability. Banded block Toeplitz matrices can be used in the sparse multi-channel source separation. The banded block Toeplitz matrices decrease the computational complexity while they have fewer number of non-zero entries in comparison to the same dimensional banded Toeplitz matrices. Furthermore, our simulation results show that banded block Toeplitz matrices outperform banded Toeplitz matrices in signal estimation. The analytical RIP bound for banded block Toeplitz matrices is provided in this paper and the RIP bound of sparse Gaussian matrices is also obtained as an upper bound for banded block Toeplitz matrices. Our simulation and analytical results show that sparse Gaussian random matrices do satisfy the RIP condition with high probability. The probability of satisfying the RIP depends on the probability of zero entries.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it