Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms

DOI10.4230/LIPIcs.APPROX-RANDOM.2015.829zbMath1386.15048arXiv1504.05287OpenAlexW2963553534MaRDI QIDQ5351938

Rong Ge, Tengyu Ma

Publication date: 31 August 2017

Full work available at URL: https://arxiv.org/abs/1504.05287

zbMATH Keywords

sum of squaresovercomplete tensor decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69)

Related Items (8)

Noisy tensor completion via the sum-of-squares hierarchy ⋮ On the optimization landscape of tensor decompositions ⋮ Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models ⋮ Identifiability for mixtures of centered Gaussians and sums of powers of quadratics ⋮ Unnamed Item ⋮ Barriers for Rank Methods in Arithmetic Complexity ⋮ Notes on computational-to-statistical gaps: predictions using statistical physics ⋮ Unnamed Item

This page was built for publication: Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms