All-at-once Optimization for Coupled Matrix and Tensor Factorizations

Abstract

Joint analysis of data from multiple sources has the potential to improve our understanding of the underlying structures in complex data sets. For instance, in restaurant recommendation systems, recommendations can be based on rating histories of customers. In addition to rating histories, customers' social networks (e.g., Facebook friendships) and restaurant categories information (e.g., Thai or Italian) can also be used to make better recommendations. The task of fusing data, however, is challenging since data sets can be incomplete and heterogeneous, i.e., data consist of both matrices, e.g., the person by person social network matrix or the restaurant by category matrix, and higher-order tensors, e.g., the "ratings" tensor of the form restaurant by meal by person. In this paper, we are particularly interested in fusing data sets with the goal of capturing their underlying latent structures. We formulate this problem as a coupled matrix and tensor factorization (CMTF) problem where heterogeneous data sets are modeled by fitting outer-product models to higher-order tensors and matrices in a coupled manner. Unlike traditional approaches solving this problem using alternating algorithms, we propose an all-at-once optimization approach called CMTF-OPT (CMTF-OPTimization), which is a gradient-based optimization approach for joint analysis of matrices and higher-order tensors. We also extend the algorithm to handle coupled incomplete data sets. Using numerical experiments, we demonstrate that the proposed all-at-once approach is more accurate than the alternating least squares approach.

References in corpus (1)

• Scalable Tensor Factorizations for Incomplete Data

Cited by in corpus (38)

• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions for Signal Processing Applications From Two-way to Multiway Component Analysis
• DFacTo: Distributed Factorization of Tensors
• Exploring multimodal data fusion through joint decompositions with flexible couplings
• Tensors, Learning, and 'Kolmogorov Extension' for Finite-alphabet Random Vectors
• A Flexible Optimization Framework for Regularized Matrix-Tensor Factorizations with Linear Couplings
• Zero-Truncated Poisson Tensor Factorization for Massive Binary Tensors
• Link Prediction via Generalized Coupled Tensor Factorisation
• Tensor Completion Algorithms in Big Data Analytics
• Integrative Generalized Convex Clustering Optimization and Feature Selection for Mixed Multi-View Data
• Learning from Multi-View Multi-Way Data via Structural Factorization Machines
• Semi-parametric TEnsor Factor Analysis by Iteratively Projected Singular Value Decomposition
• Efficient Nonnegative Tensor Factorization via Saturating Coordinate Descent
• Phenotyping using Structured Collective Matrix Factorization of Multi--source EHR Data
• Scoup-SMT: Scalable Coupled Sparse Matrix-Tensor Factorization
• Heterogeneous Network Motifs
• CIMTDetect: A Community Infused Matrix-Tensor Coupled Factorization Based Method for Fake News Detection
• PARAFAC2-based Coupled Matrix and Tensor Factorizations
• Fast, Accurate, and Scalable Method for Sparse Coupled Matrix-Tensor Factorization
• Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data
• Word Embeddings via Tensor Factorization
• MTC: Multiresolution Tensor Completion from Partial and Coarse Observations
• Sampler Design for Implicit Feedback Data by Noisy-label Robust Learning
• A Unified Framework for Coupled Tensor Completion
• Multi-Relational Learning at Scale with ADMM
• Weighted Random Walk Sampling for Multi-Relational Recommendation
• Joint Embedding of Meta-Path and Meta-Graph for Heterogeneous Information Networks
• Completing a joint PMF from projections: a low-rank coupled tensor factorization approach
• A Nonlinearly Preconditioned Conjugate Gradient Algorithm for Rank-R Canonical Tensor Approximation
• Variational Bayesian inference for CP tensor completion with side information
• VecHGrad for Solving Accurately Complex Tensor Decomposition
• PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite
• From Persistent Homology to Reinforcement Learning with Applications for Retail Banking
• Visually-aware Recommendation with Aesthetic Features
• User-Device Authentication in Mobile Banking using APHEN for Paratuck2 Tensor Decomposition
• Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization
• Tensor-based framework for training flexible neural networks
• MLCTR: A Fast Scalable Coupled Tensor Completion Based on Multi-Layer Non-Linear Matrix Factorization