atlas

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

Fitting Low-Rank Tensors in Constant Time

NeurIPS 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized tensor decomposition algorithms · 3 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
sample indices per mode (s=40 or 80) instead of full tensor for residual estimationTucker residual error estimation · Real datasets (8 tensors)absolute error vs HOOI residual (averaged over ranks)Helped
replace HOOI with sampling-based residual estimate (sample80)Tucker rank ordering · visor, EEM, movie_grayKendall's tau vs HOOI rankingHelped
sample size s=80 vs s=40 (ablation)Sampling estimator · Real datasetsKendall's tau and absolute errorHelped
sampling-based residual estimate on sparse 'wine' tensorTucker residual estimation · wineabsolute error vs HOOIMixed
randomized SVD replaced by sampling for residual estimationRuntime · Real datasetsruntime vs HOOIHelped
MACH sparsification (p=0.1 or 0.3)Tucker residual estimation · Real datasetsabsolute error vs HOOIHurt
small sample size s (synthetic) (ablation)Sampling estimator · Synthetic N=100-800estimated residual errorHurt

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