arXiv (All)
open access
Optimal Projections for Discriminative Dictionary Learning using the JL-lemma
computer-vision-and-pattern-recognitionemerging-technologiesmachine-learningperformancesignal-processing
Dimensionality reduction-based dictionary learning methods in the literature have often used iterative random projections. The dimensionality of such a random projection matrix is a random number that might not lead to a separable subspace structure in the transformed space. The convergence of such
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
- Random matrix theory in statistics: A review#1174916
- On Kernel Eigen-alignments of KRR: Reconstruction and Generalization#1036700
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#794206
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#790187
- Randomized SVD Approximations for Spectral Co-Clustering of Word-Document Matrices#1013841
Record · ID 1456014
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