Home › Entities › academia › Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms

Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms

Research article (Signal Processing, 2019) · cited 21× · AI/ML
academia openalex:W2977149162
Press Enter · cited answer in seconds

Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms

Summary

Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms is a scholarly article[1].

Key Facts

  • Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms. Retrieved May 24, 2026, from https://4ort.xyz/entity/robust-tensor-decomposition-via-t-svd-near-optimal-statistical-guarantee-and-scalable-algorithms
MLA “Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/robust-tensor-decomposition-via-t-svd-near-optimal-statistical-guarantee-and-scalable-algorithms.
BibTeX @misc{4ortxyz_robust-tensor-decomposition-via-t-svd-near-optimal-statistical-guarantee-and-scalable-algorithms_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms}}, year = {2026}, url = {https://4ort.xyz/entity/robust-tensor-decomposition-via-t-svd-near-optimal-statistical-guarantee-and-scalable-algorithms}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms — https://4ort.xyz/entity/robust-tensor-decomposition-via-t-svd-near-optimal-statistical-guarantee-and-scalable-algorithms (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/robust-tensor-decomposition-via-t-svd-near-optimal-statistical-guarantee-and-scalable-algorithms · Last refreshed: