atlas

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

Learning a Latent Simplex in Input Sparsity Time

ICLR 2021 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning · 1 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
Use an input-sparsity mixed spectral-Frobenius approximation instead of computing the top-k subspace with power iterationLatent simplex learning · Synthetic dataruntimeHelped
Use an input-sparsity mixed spectral-Frobenius approximation instead of computing the top-k subspace with power iterationLatent simplex learning · email-Eu-core networkruntimeHelped
Use an input-sparsity mixed spectral-Frobenius approximation instead of computing the top-k subspace with power iterationLatent simplex learning · com-YoutuberuntimeHelped
Use the input-sparsity approximation algorithm instead of the top-k subspace algorithmLatent simplex learning · com-Youtubeleast squares lossHelped
Use a mixed spectral-Frobenius approximation under the Significant Singular Values assumptionLatent simplex learning · Latent Simplex Modelrunning time: O(nnz(A) + (n+d)poly(k/φ))Helped

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