Tensor decomposition via joint matrix schur decomposition

Nicolo Colombo, Nikos Vlassis

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We describe an approach to tensor decomposition that involves extracting a set of observable matrices from the tensor and applying an approximate joint Schur decomposition on those matrices, and wc establish the corresponding first-order perturbation bounds. We develop a novel iterative Gauss-Newton algorithm for joint matrix Schur decomposition, which minimizes a nonconvex objective over the manifold of orthogonal matrices, and which is guaranteed to con-verge to a global optimum under certain conditions. We empirically demonstrate that our algorithm is faster and at least as accurate and robust than state-of-the-art algorithms for this problem.

Original languageEnglish
Title of host publicationICML'16
Subtitle of host publicationProceedings of the 33rd International Conference on International Conference on Machine Learning
EditorsKilian Q. Weinberger, Maria Florina Balcan
Number of pages9
ISBN (Electronic)9781510829008
Publication statusPublished - 19 Jun 2016
Event33rd International Conference on Machine Learning, ICML 2016 - New York City, United States
Duration: 19 Jun 201624 Jun 2016

Publication series

Name33rd International Conference on Machine Learning, ICML 2016


Conference33rd International Conference on Machine Learning, ICML 2016
Country/TerritoryUnited States
CityNew York City

Cite this