RECORD
Compressed matched filter for non-Gaussian noise
Applications · Submitted 3 Nov 2013
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We demonstrate the advantages of the proposed framework using synthetic simulations.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We consider estimation of a deterministic unknown parameter vector in a linear model with non-Gaussian noise. In the Gaussian case, dimensionality reduction via a linear matched filter provides a simple low dimensional sufficient statistic which can be easily communicated and/or stored for future inference. Such a statistic is usually unknown in the general non-Gaussian case. Instead, we propose a hybrid matched filter coupled with a randomized compressed sensing procedure, which together create a low dimensional statistic. We also derive a complementary algorithm for robust reconstruction given this statistic. Our recovery method is based on the fast iterative shrinkage and thresholding algorithm which is used for outlier rejection given the compressed data. We demonstrate the advantages of the proposed framework using synthetic simulations.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We consider estimation of a deterministic unknown parameter vector in a linear model with non-Gaussian noise. | background 0.99 | 0.35 | 0.03 | asserted 0.71 |
| s1 | In the Gaussian case, dimensionality reduction via a linear matched filter provides a simple low dimensional sufficient statistic which can be easily communicated and/or stored for future inference. | background 1.00 | 0.07 | 0.04 | asserted 0.99 |
| s2 | Such a statistic is usually unknown in the general non-Gaussian case. | gap 0.98 | 0.07 | 0.03 | asserted 0.97 |
| s3 | Instead, we propose a hybrid matched filter coupled with a randomized compressed sensing procedure, which together create a low dimensional statistic. | contribution 0.60 | 0.93 | 0.38 | asserted 0.98 |
| s4 | We also derive a complementary algorithm for robust reconstruction given this statistic. | contribution 0.65 | 0.95 | 0.11 | asserted 1.00 |
| s5 | Our recovery method is based on the fast iterative shrinkage and thresholding algorithm which is used for outlier rejection given the compressed data. | method 0.99 | 0.66 | 0.09 | asserted 1.00 |
| s6 | We demonstrate the advantages of the proposed framework using synthetic simulations. | result 0.51 | 0.95 | 0.16 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We consider estimation of a deterministic unknown parameter vector in a linear model with non-Gaussian noise. In the Gaussian case, dimensionality reduction via a linear matched filter provides a simple low dimensional sufficient statistic which can be easily communicated and/or stored for future inference. Such a statistic is usually unknown in the general non-Gaussian case. Instead, we propose a hybrid matched filter coupled with a randomized compressed sensing procedure, which together create a low dimensional statistic. We also derive a complementary algorithm for robust reconstruction given this statistic. Our recovery method is based on the fast iterative shrinkage and thresholding algorithm which is used for outlier rejection given the compressed data. We demonstrate the advantages of the proposed framework using synthetic simulations.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.