atlas

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

A Nullspace Property for Subspace-Preserving Recovery

ICML 2021 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse regression with guarantees

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Normalize data columns with l2-norm instead of other lp-norms (p != 2)subspace-preserving recovery (SNSP verification) · theoretical analysis, rotation-invariance exampleSNSP satisfaction under orthogonal transformationHelped
Normalize columns with l-infinity norm instead of l2subspace-preserving recovery (SNSP) · Example 1 (three subspaces in R^3)SNSP satisfactionHurt
Replace the data-matrix verification of SNSP with verification on only the extreme points of the symmetrized convex hull of each subspace's pointsSNSP verification · theoretical analysis (Lemma 1)equivalence of SNSP verificationNo clear effect
Sufficient condition based on inner-radius vs outer-radius comparison (Cor. 2) instead of incoherence condition (You & Vidal 2015)subspace-preserving recovery guarantee · theoretical comparison with You & Vidal (2015)strength of sufficient conditionHelped

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