eScholarship
metadata only
A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values
The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Spherical Occupancy Profiles for Multi-View 3D Reconstruction and Generation#971864
- Constrained Nonconvex Stochastic Optimization with One Projection#1119172
- A General Framework for Compressed Sensing and Parallel MRI Using Annihilating Filter Based Low-Rank Hankel Matrix#257803
- A Jet-Order Separation Theorem for Berry Curvature#729504
- Constrained dynamics for searching saddle points on embedded Riemannian submanifolds of Euclidean space#924038
Record · ID 983457
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive