AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Optimal Sparse Linear Encoders and Sparse PCA

Malik Magdon-Ismail, Christos Boutsidis

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse and robust PCA · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed sparse linear auto-encoder algorithms (Batch or Iterative) instead of the compared sparse PCA baselinesPitProps, Lymphoma, and Colon · PitProps, Lymphoma, and Colon (k=2)information lossImproved
Optimize symmetric explained variance rather than information lossTPower, Gpower-ℓ0, and Gpower-ℓ1 · PitProps, Lymphoma, and Colon (k=2)symmetric explained varianceImproved
Use the iterative algorithm rather than the batch algorithmProposed sparse linear auto-encoder · Sparse linear encoding; experiments use PitProps, Lymphoma, and Coloninformation lossNo clear effect
Use the iterative algorithm rather than the batch algorithmProposed sparse linear auto-encoder · Sparse linear encoding; experiments use PitProps, Lymphoma, and Colonfeature sparsityImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy