MLLGNov 24, 2019

Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data

arXiv:1911.10454v32 citations
Originality Incremental advance
AI Analysis

This work addresses data analysis challenges in heterogeneous domains such as bioinformatics and recommendation systems, offering an incremental improvement over conventional tensor methods.

The authors tackled the problem of modeling heterogeneous datasets with joint low-rank and discriminative structures by introducing a double core tensor factorization model with smoothing functions, achieving accurate factor estimation even with missing entries and demonstrating effectiveness in applications like image completion and recommender systems.

We introduce a general tensor model suitable for data analytic tasks for {\em heterogeneous} datasets, wherein there are joint low-rank structures within groups of observations, but also discriminative structures across different groups. To capture such complex structures, a double core tensor (DCOT) factorization model is introduced together with a family of smoothing loss functions. By leveraging the proposed smoothing function, the model accurately estimates the model factors, even in the presence of missing entries. A linearized ADMM method is employed to solve regularized versions of DCOT factorizations, that avoid large tensor operations and large memory storage requirements. Further, we establish theoretically its global convergence, together with consistency of the estimates of the model parameters. The effectiveness of the DCOT model is illustrated on several real-world examples including image completion, recommender systems, subspace clustering and detecting modules in heterogeneous Omics multi-modal data, since it provides more insightful decompositions than conventional tensor methods.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes