Random projections of smooth manifolds
DOI10.1007/s10208-007-9011-zzbMath1172.53005OpenAlexW1986736933WikidataQ125259994 ScholiaQ125259994MaRDI QIDQ1029551
Richard G. Baraniuk, Michael B. Wakin
Publication date: 13 July 2009
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/19724
manifoldsdimensionality reductionrandom projectionsparsitymanifold learningcompressed sensingJohnson-Lindenstrauss lemma
Multivariate analysis (62H99) Learning and adaptive systems in artificial intelligence (68T05) Higher-dimensional and -codimensional surfaces in Euclidean and related (n)-spaces (53A07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the stability of the basis pursuit in the presence of noise
- Random projections of smooth manifolds
- A simple proof of the restricted isometry property for random matrices
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Finding the homology of submanifolds with high confidence from random samples
- Diffusion wavelets
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Image manifolds which are isometric to Euclidean space
- The Whitney Reduction Network: A Method for Computing Autoassociative Graphs
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Reconstruction From Noisy Random Projections
- Nearest-neighbor-preserving embeddings
- A New Approach to Dimensionality Reduction: Theory and Algorithms
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Geodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
- Neighborliness of randomly projected simplices in high dimensions
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Multiscale Representations for Manifold-Valued Data
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing