AI Paper Atlas

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

A Sharp Blockwise Tensor Perturbation Bound for Orthogonal Iteration

Yuetian Luo, Garvesh Raskutti, Ming Yuan, Anru R. Zhang

JMLR 2021 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory · 9 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 HOOI instead of the noisy tensor itself for reconstructionHOOI · Simulated tensor reconstructionHilbert-Schmidt reconstruction errorImproved
increase dimension p and noise level sigmaHOOI · Simulated tensor reconstructionRMSEHurt
use HOOI instead of T-HOSVD and ST-HOSVDtensor denoising · Simulated tensor denoising (p=100, r=5)reconstruction and subspace errorImproved
run only one HOOI iteration (O-HOOI) instead of full HOOI (ablation)HOOI · Simulated tensor denoising (p=100, r=5)reconstruction and subspace errorMixed
use HOOI-based clustering instead of T-HOSVD, ST-HOSVD, O-HOOI based spectral clusteringtensor co-clustering · Simulated co-clustering (r=5)misclassification error rateImproved
increase signal strengthHOOI co-clustering · Simulated co-clusteringmisclassification error rateImproved

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