The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
Open accessAbstract
Consider an $m \times N$ matrix $\Phi$ with the restricted isometry property of order k and level $\delta$; that is, the norm of any k-sparse vector in $\mathbb{R}^N$ is preserved to within a multiplicative factor of $1 \pm \delta$ under application of $\Phi$. We show that by randomizing the column signs of such a matrix $\Phi$, the resulting map with high probability embeds any fixed set of $p = O(e^k)$ points in $\mathbb{R}^N$ into $\mathbb{R}^m$ without distorting the norm of any point in the set by more than a factor of $1 \pm 4 \delta$. Consequently, matrices with the restricted isometry property and with randomized column signs provide optimal Johnson–Lindenstrauss embeddings up to logarithmic factors in N. In particular, our results improve the best known bounds on the necessary embedding dimension m for a wide class of structured random matrices; for partial Fourier and partial Hadamard matrices, we improve the recent bound $m \gtrsim \delta^{-4} \log(p) \log^4(N)$ given by Ailon and Liberty to $m \gtrsim \delta^{-2} \log(p) \log^4(N)$, which is optimal up to the logarithmic factors in N. Our results also have a direct application in the area of compressed sensing for redundant dictionaries.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
An elementary proof of a theorem of Johnson and Lindenstrauss
Dasgupta, S., & Gupta, A. (2003) · Random Structures & Algorithms · doi:10.1002/rsa.10073 · Cited by 932
Compressed sensing with coherent and redundant dictionaries
Candès, E. J., Eldar, Y. C., Needell, D., & Randall, P. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.10.002 · Cited by 898
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Improved Approximation Algorithms for Large Matrices via Random Projections
Sarlos, T. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.37 · Cited by 646
Deterministic constructions of compressed sensing matrices
DeVore, R. (2007) · Journal of Complexity · doi:10.1016/j.jco.2007.04.002 · Cited by 591
Randomized algorithms for the low-rank approximation of matrices
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709640104 · Cited by 559
Compressive Sensing by Random Convolution
Romberg, J. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/08072975x · Cited by 458
Random Projections of Smooth Manifolds
Baraniuk, R. G., & Wakin, M. B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-007-9011-z · Cited by 404
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Ailon, N., & Chazelle, B. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132597 · Cited by 379
A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
Hanson, D. L., & Wright, F. T. (1971) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177693335 · Cited by 326
Compressive Sensing with structured random matrices
Rauhut, H. (2010) · Cited by 322
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
Frankl, P., & Maehara, H. (1988) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(88)90043-3 · Cited by 299
Concentration inequalities using the entropy method
Boucheron, S., Lugosi, G., & Massart, P. (2003) · The Annals of Probability · doi:10.1214/aop/1055425791 · Cited by 235
EXPLICIT CONSTRUCTIONS OF RIP MATRICES AND RELATED PROBLEMS
Bourgain, J., Dilworth, S. J., Ford, K., et al. (2010) · Cited by 232
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
Ailon, N., & Liberty, E. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9110-x · Cited by 194
Compressed Sensing With Cross Validation
Ward, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032712 · Cited by 146
Self-citationCirculant and Toeplitz matrices in compressed sensingPreprint
Rauhut, H. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0902.4394 · Cited by 133
A variant of the Johnson–Lindenstrauss lemma for circulant matrices
Vybíral, J. (2010) · Journal of Functional Analysis · doi:10.1016/j.jfa.2010.11.014 · Cited by 53
Dense Fast Random Projections and Lean Walsh Transforms
Liberty, E., Ailon, N., & Singer, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85363-3_40 · Cited by 52
Cited by
Compressed sensing with coherent and redundant dictionaries
Candès, E. J., Eldar, Y. C., Needell, D., & Randall, P. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.10.002 · Cited by 898
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Stable Image Reconstruction Using Total Variation Minimization
Needell, D., & Ward, R. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120868281 · Cited by 259
Self-citation
Metadata
- Authors
- Krahmer, F., & Ward, R.
- Venue
- SIAM Journal on Mathematical Analysis
- Published
- 2011-01
- Volume
- 43
- Issue
- 3
- Pages
- 1269-1281
- ISSN
- 0036-1410 (ISSN-L)
- 1095-7154
- OpenAlex
- W1566187773
- Cited by
- 290
- References
- 29
- FWCI
- 29.68
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.