Name
Abstract | ||
|---|---|---|
AbstractRandom projections are random linear maps, sampled from appropriate distributions, which approximately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well known Johnson-Lindenstrauss lemma states that there are random matrices with surprisingly few rows which approximately preserve pairwise Euclidean distances among a set of points. This is commonly used to speed up algorithms based on Euclidean distances. We prove that these matrices also preserve other quantities, such as the distance to a cone. We exploit this result to devise a probabilistic algorithm to approximately solve linear programs. We show that this algorithm can approximately solve very large randomly generated LP instances. We also showcase its application to an error correction coding problem. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1287/moor.2017.0894 | Periodicals |
Keywords | Field | DocType |
Johnson-Lindenstrauss lemma,concentration of measure,dimension reduction | Discrete mathematics,Randomized algorithm,Concentration of measure,Dimensionality reduction,Matrix (mathematics),Invariant (mathematics),Linear programming,Mathematics,Random matrix,Johnson–Lindenstrauss lemma | Journal |
Volume | Issue | ISSN |
43 | 4 | 0364-765X |
Citations | PageRank | References |
1 | 0.35 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ky Khac Vu | 1 | 8 | 2.20 |
| Pierre-Louis Poirion | 2 | 24 | 7.43 |
| Leo Liberti | 3 | 1280 | 105.20 |