Numerical optimization for symmetric tensor decomposition
نویسندگان
چکیده
منابع مشابه
Numerical Optimization for Symmetric Tensor Decomposition
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on real-valued decompositions, both unconstrained and nonnegative. We discuss when solutions exist and how to formulate the mathematical program. Numerical results sh...
متن کاملSymmetric curvature tensor
Recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. Using this machinery, we have defined the concept of symmetric curvature. This concept is natural and is related to the notions divergence and Laplacian of vector fields. This concept is also related to the derivations on the algebra of symmetric forms which has been discu...
متن کاملGreedy Approaches to Symmetric Orthogonal Tensor Decomposition
Finding the symmetric and orthogonal decomposition (SOD) of a tensor is a recurring problem in signal processing, machine learning and statistics. In this paper, we review, establish and compare the perturbation bounds for two natural types of incremental rank-one approximation approaches. Numerical experiments and open questions are also presented and discussed.
متن کاملSymmetric Orthogonal Tensor Decomposition is Trivial
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued, pairwise orthogonal vectors. Such decompositions do not generally exist, but we show that some symmetric tensor decomposition problems can be converted to orthogonal problems following the whitening procedure proposed by Anandkumar et al. (2012). If an orthogonal decomposition of a...
متن کاملIterative Methods for Symmetric Outer Product Tensor Decomposition
We study the symmetric outer product for tensors. Specifically, we look at decomposition of fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present an iterative technique for the third-order partially symmetric tensor and fourthorder fully and partially symmetric tensor. We included several numerical examples which indicate a faster convergence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2015
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-015-0895-0