Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision

Pascal Koiran, Subhayan Saha

Type: Book-Chapter

Publication Date: 2023-01-01

Citations: 1

DOI: https://doi.org/10.1007/978-3-031-30448-4_22

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision	2022	Pascal Koiran Subhayan Saha
+ PDF Chat	Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number	2024	Pascal Koiran Subhayan Saha
+	Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions	2022	Arvind V. Mahankali David P. Woodruff Ziyu Zhang
+ PDF Chat	A nearly optimal algorithm to decompose binary forms	2020	Matías R. Bender Jean‐Charles Faugère Ludovic Perret Elias Tsigaridas
+	A Superfast Randomized Algorithm to Decompose Binary Forms	2016	Matías R. Bender Jean‐Charles Faugère Ludovic Perret Elias Tsigaridas
+	A nearly optimal algorithm to decompose binary forms.	2018	Matías R. Bender Jean‐Charles Faugère Ludovic Perret Elias Tsigaridas
+	Fast algorithm for overcomplete order-3 tensor decomposition	2022	Jingqiu Ding Tommaso d'Orsi Chih-Hung Liu Stefan Tiegel David Steurer
+	Exact tensor completion with sum-of-squares	2017	Aaron Potechin David Steurer
+	Exact tensor completion with sum-of-squares	2017	Aaron Potechin David Steurer
+	Exact tensor completion with sum-of-squares	2017	Aaron Potechin David Steurer
+	Efficient algorithms for tensor decompositions	2012	Laurent Sorber Marc Van Barel Lieven De Lathauwer
+	Fitting Low-Rank Tensors in Constant Time	2017	Kohei Hayashi Yuichi Yoshida
+	Tensor decompositions: invariance and computational complexity / Matt Hoogsteder Riera	2020	Matt Hoogsteder Riera
+	Bounds on complexity of matrix multiplication away from Coppersmith–Winograd tensors	2022	Roser Homs Joachim Jelisiejew Mateusz Michałek Tim Seynnaeve
+ PDF Chat	On Polynomial Time Methods for Exact Low-Rank Tensor Completion	2019	Dong Xia Ming Yuan
+	Algorithms for tensor decompositions and applications	2011	Phan Anh Huy
+	Randomized algorithms for the approximations of Tucker and the tensor train decompositions	2018	Maolin Che Yimin Wei
+	Sublinear time orthogonal tensor decomposition	2016	Zhao Song David P. Woodruff Huan Zhang
+ PDF Chat	Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format	2020	Rachel Minster Arvind K. Saibaba Misha E. Kilmer
+ PDF Chat	A universal sequence of tensors for the asymptotic rank conjecture	2024	Petteri Kaski Mateusz Michałek

Works That Cite This (1)

Action	Title	Year	Authors
+	Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond	2023	Pascal Koiran Subhayan Saha

Works Cited by This (15)

Action	Title	Year	Authors
+	Tensor rank is NP-complete	1989	Johan Håstad
+	Computing symmetric rank for symmetric tensors	2010	Alessandra Bernardi Alessandro Gimigliano Monica Idà
+	Tensor Decompositions and Applications	2009	Tamara G. Kolda Brett W. Bader
+	A Decomposition for Three-Way Arrays	1993	Sue E. Leurgans R. Ross Robert Abel
+ PDF Chat	Smoothed analysis of tensor decompositions	2014	Aditya Bhaskara Moses Charikar Ankur Moitra Aravindan Vijayaraghavan
+	Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics	1977	Joseph B. Kruskal
+ PDF Chat	Fourier PCA and robust tensor decomposition	2014	Navin Goyal Santosh Vempala Ying Xiao
+	Complexity theory and numerical analysis	1997	Steve Smale
+	Algorithmic Aspects of Machine Learning	2018	Ankur Moitra
+	Tensor Reconstruction Beyond Constant Rank	2022	Shir Peleg Amir Shpilka Ben Lee Volk