The Best Rank-One Approximation Ratio of a Tensor Space
نویسندگان
چکیده
منابع مشابه
The Best Rank-One Approximation Ratio of a Tensor Space
Abstract. In this paper we define the best rank-one approximation ratio of a tensor space. It turns out that in the finite dimensional case this provides an upper bound for the quotient of the residual of the best rankone approximation of any tensor in that tensor space and the norm of that tensor. This upper bound is strictly less than one, and it gives a convergence rate for the greedy rank-o...
متن کاملOn orthogonal tensors and best rank-one approximation ratio
As is well known, the smallest possible ratio between the spectral norm and the Frobenius norm of an m× n matrix with m ≤ n is 1/ √ m and is (up to scalar scaling) attained only by matrices having pairwise orthonormal rows. In the present paper, the smallest possible ratio between spectral and Frobenius norms of n1×· · ·×nd tensors of order d, also called the best rank-one approximation ratio i...
متن کاملOn best rank one approximation of tensors
Today, compact and reduced data representations using low rank data approximation are common to represent high-dimensional data sets in many application areas as for example genomics, multimedia, quantum chemistry, social networks or visualization. In order to produce such low rank data representations, the input data is typically approximated by so-called alternating least squares (ALS) algori...
متن کاملBEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES
We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by X boxtimesY. We investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...
متن کاملBest Rank-One Tensor Approximation and Parallel Update Algorithm for CPD
A novel algorithm is proposed for CANDECOMP/PARAFAC tensor decomposition to exploit best rank-1 tensor approximation. Different from the existing algorithms, our algorithm updates rank-1 tensors simultaneously in-parallel. In order to achieve this, we develop new all-at-once algorithms for best rank-1 tensor approximation based on the Levenberg-Marquardt method and the rotational update. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2011
ISSN: 0895-4798,1095-7162
DOI: 10.1137/100795802