Quantifying low rank approximations of third order symmetric tensors

Abstract In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or quantified quasi-optimal low rank approximation is obtained if the control parameter is positive. This is based on a primal-dual method for computing a low rank approximation for a given tensor. The certification is derived from the global optimality of the primal and dual problems, and is characterized by easily checkable relations between the primal and the dual solutions together with another rank condition. The theory is verified theoretically for orthogonally decomposable tensors as well as numerically through examples in the general case.

Authors

Institutions

Publication Details

Journal
Mathematical Programming
Published
2024-11-28
DOI
https://doi.org/10.1007/s10107-024-02165-1
Citations
1
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantifying low rank approximations of third order symmetric tensors

Defeng Sun, Shenglong Hu, Kim-Chuan Toh
1 citations
Mathematical Programming
Tensor decomposition and applications
0.33
article

Quantifying low rank approximations of third order symmetric tensors

Defeng Sun, Shenglong Hu, Kim-Chuan Toh
article en
1 citations

Abstract

Abstract In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or quantified quasi-optimal low rank approximation is obtained if the control parameter is positive. This is based on a primal-dual method for computing a low rank approximation for a given tensor. The certification is derived from the global optimality of the primal and dual problems, and is characterized by easily checkable relations between the primal and the dual solutions together with another rank condition. The theory is verified theoretically for orthogonally decomposable tensors as well as numerically through examples in the general case.

Mathematical ProgrammingVol. 213(1-2)
Hong Kong Polytechnic University (HK), National University of Singapore (SG), National University of Defense Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Zhejiang Province
Openalex Percentile: Top 46%
Tensor decomposition and applications
0.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.