atlas

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

High-Rank Matrix Completion and Clustering under Self-Expressive Models

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 44 citations (OpenAlex)

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
Lifting-based group-sparse SSC with rank-one constraints (SSC-Lifting) instead of low-rank completion followed by clusteringhigh-rank synthetic and CMU Mocap data · high-rank synthetic (n=100, L=12, d=10) and CMU Mocapcompletion errorHelped
Lifting-based SSC-Lifting instead of low-rank completion followed by SSClow-rank motion segmentation (Hopkins 155) · Hopkins 155clustering errorNo clear effect
Column-wise expectation completion (SSC-CEC) baseline versus SSC-Liftingmotion segmentation with missing entries · Hopkins 155clustering errorHurt
Rank-one (lifting) constraint removed versus kept, nuclear-norm relaxation weight gamma varied (ablation)SSC-Lifting · synthetic high-rankstable rank of blocks A_iNo clear effect

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