Results 11 to 20 of about 3,363 (257)
Optimization landscape of Tucker decomposition [PDF]
Tucker decomposition is a popular technique for many data analysis and machine learning applications. Finding a Tucker decomposition is a nonconvex optimization problem. As the scale of the problems increases, local search algorithms such as stochastic gradient descent have become popular in practice.
Abraham Frandsen, Rong Ge 0001
openaire +2 more sources
VOLUME-REGULARIZED NONNEGATIVE TUCKER DECOMPOSITION WITH IDENTIFIABILITY GUARANTEES. [PDF]
It is well-known that the Tucker decomposition of a multi-dimensional tensor is not unique, because its factors are subject to rotation ambiguities similar to matrix factorization models. Inspired by the recent success in the identifiability of nonnegative matrix factorization, the goal of this work is to achieve similar results for nonnegative Tucker ...
Sun Y, Huang K.
europepmc +3 more sources
Robust Barron-Loss Tucker Tensor Decomposition [PDF]
<p>In this work, we propose a new formulation for low-rank tensor approximation, with tunable outlier-robustness, and present a unified algorithmic solution framework. This formulation relies on a new generalized robust loss function (Barron loss), which encompasses several well-known loss-functions with variable outlier resistance.
Panos P. Markopoulos, Mahsa Mozaffari
openaire +1 more source
Tucker Tensor Decomposition on FPGA [PDF]
Tensor computation has emerged as a powerful mathematical tool for solving high-dimensional and/or extreme-scale problems in science and engineering. The last decade has witnessed tremendous advancement of tensor computation and its applications in machine learning and big data. However, its hardware optimization on resource-constrained devices remains
Kaiqi Zhang 0002 +2 more
openaire +2 more sources
Dynamic L1-Norm Tucker Tensor Decomposition [PDF]
<p>Tucker decomposition is a standard method for processing multi-way (tensor) measurements and finds many applications in machine learning and data mining, among other fields. When tensor measurements arrive in a streaming fashion or are too many to jointly decompose, incremental Tucker analysis is preferred.
Dimitris G. Chachlakis +3 more
openaire +1 more source
Orthogonal tucker decomposition using factor priors for 2D+3D facial expression recognition
In this article, an effective approach is proposed to recognise the 2D+3D facial expression automatically based on orthogonal Tucker decomposition using factor priors (OTDFPFER).
Yunfang Fu +4 more
doaj +1 more source
Application of Tucker Decomposition in Temperature Distribution Reconstruction
Constrained by cost, measuring conditions and excessive calculation, it is difficult to reconstruct a 3D real-time temperature field. For the purpose of solving these problems, a three-dimensional temperature distribution reconstruction algorithm based ...
Zhaoyu Liu +4 more
doaj +1 more source
Orthogonal random projection for tensor completion
The low‐rank tensor completion problem, which aims to recover the missing data from partially observable data. However, most of the existing tensor completion algorithms based on Tucker decomposition cannot avoid using singular value decomposition (SVD ...
Yali Feng, Guoxu Zhou
doaj +1 more source
A Hybrid Norm for Guaranteed Tensor Recovery
Benefiting from the superiority of tensor Singular Value Decomposition (t-SVD) in excavating low-rankness in the spectral domain over other tensor decompositions (like Tucker decomposition), t-SVD-based tensor learning has shown promising performance and
Yihao Luo +5 more
doaj +1 more source
Reconstruction Optimization Algorithm of 3D Temperature Distribution Based on Tucker Decomposition
For the purpose of solving the large temperature field reconstruction error caused by different measuring point arrangements and the problem that the prior dataset cannot be built due to data loss or distortion in actual measurement, a three-dimensional ...
Zhaoyu Liu +3 more
doaj +1 more source

