PARAFAC2-based Coupled Matrix and Tensor Factorizations
- URL: http://arxiv.org/abs/2210.13054v1
- Date: Mon, 24 Oct 2022 09:20:17 GMT
- Title: PARAFAC2-based Coupled Matrix and Tensor Factorizations
- Authors: Carla Schenker, Xiulin Wang and Evrim Acar
- Abstract summary: We propose an algorithmic framework for fitting PARAFAC2-based CMTF models with the possibility of imposing various constraints on all modes and linear couplings.
Through numerical experiments, we demonstrate that the proposed algorithmic approach accurately recovers the underlying patterns using various constraints and linear couplings.
- Score: 1.7188280334580195
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Coupled matrix and tensor factorizations (CMTF) have emerged as an effective
data fusion tool to jointly analyze data sets in the form of matrices and
higher-order tensors. The PARAFAC2 model has shown to be a promising
alternative to the CANDECOMP/PARAFAC (CP) tensor model due to its flexibility
and capability to handle irregular/ragged tensors. While fusion models based on
a PARAFAC2 model coupled with matrix/tensor decompositions have been recently
studied, they are limited in terms of possible regularizations and/or types of
coupling between data sets. In this paper, we propose an algorithmic framework
for fitting PARAFAC2-based CMTF models with the possibility of imposing various
constraints on all modes and linear couplings, using Alternating Optimization
(AO) and the Alternating Direction Method of Multipliers (ADMM). Through
numerical experiments, we demonstrate that the proposed algorithmic approach
accurately recovers the underlying patterns using various constraints and
linear couplings.
Related papers
- Sparse Tensor PCA via Tensor Decomposition for Unsupervised Feature Selection [8.391109286933856]
We develop two Sparse Principal Component Analysis (STPCA) models that utilize the projection directions in the factor matrices to perform unsupervised feature selection.
For both models, we prove the optimal solution of each subproblem falls onto the Hermitian Positive Semidefinite Cone (HPSD)
According to the experimental results, the two proposed methods are suitable for handling different data tensor scenarios and outperform the state-of-the-art UFS methods.
arXiv Detail & Related papers (2024-07-24T04:04:56Z) - PARAFAC2-based Coupled Matrix and Tensor Factorizations with Constraints [1.0519027757362966]
We introduce a flexible algorithmic framework that fits PARAFAC2-based CMTF models using Alternating Optimization (AO) and the Alternating Direction Method of Multipliers (ADMM)
Experiments on various simulated and a real dataset demonstrate the utility and versatility of the proposed framework.
arXiv Detail & Related papers (2024-06-18T07:05:31Z) - Synergistic eigenanalysis of covariance and Hessian matrices for enhanced binary classification [72.77513633290056]
We present a novel approach that combines the eigenanalysis of a covariance matrix evaluated on a training set with a Hessian matrix evaluated on a deep learning model.
Our method captures intricate patterns and relationships, enhancing classification performance.
arXiv Detail & Related papers (2024-02-14T16:10:42Z) - Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF)
Our model directly considers the between-view relationship and exploits the between-view complementary information.
In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
arXiv Detail & Related papers (2023-03-29T14:54:19Z) - Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints.
The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution.
We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
arXiv Detail & Related papers (2022-10-21T13:19:45Z) - An AO-ADMM approach to constraining PARAFAC2 on all modes [6.3172660601651]
We propose an algorithm for fitting PARAFAC2 based on alternating optimization with the alternating direction method of multipliers (AO-ADMM)
We show that the proposed PARAFAC2 AO-ADMM approach allows for flexible constraints, recovers the underlying patterns accurately, and is computationally efficient compared to the state-of-the-art.
arXiv Detail & Related papers (2021-10-04T09:39:01Z) - PARAFAC2 AO-ADMM: Constraints in all modes [6.901159341430921]
We propose an alternating direction method of multipliers (ADMM)-based algorithm for fitting PARAFAC2 and widen the possible regularisation penalties to any proximable function.
Our numerical experiments demonstrate that the proposed ADMM-based approach for PARAFAC2 can accurately recover the underlying components from simulated data.
arXiv Detail & Related papers (2021-02-03T14:42:18Z) - Estimation of Switched Markov Polynomial NARX models [75.91002178647165]
We identify a class of models for hybrid dynamical systems characterized by nonlinear autoregressive (NARX) components.
The proposed approach is demonstrated on a SMNARX problem composed by three nonlinear sub-models with specific regressors.
arXiv Detail & Related papers (2020-09-29T15:00:47Z) - A Flexible Optimization Framework for Regularized Matrix-Tensor
Factorizations with Linear Couplings [5.079136838868448]
We propose a flexible algorithmic framework for coupled matrix and tensor factorizations.
The framework facilitates the use of a variety of constraints, loss functions and couplings with linear transformations.
arXiv Detail & Related papers (2020-07-19T06:49:59Z) - Model Fusion with Kullback--Leibler Divergence [58.20269014662046]
We propose a method to fuse posterior distributions learned from heterogeneous datasets.
Our algorithm relies on a mean field assumption for both the fused model and the individual dataset posteriors.
arXiv Detail & Related papers (2020-07-13T03:27:45Z) - Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling.
We design a novel structured tensor low-rank norm tailored to MVSC.
We show that the proposed method outperforms state-of-the-art methods to a significant extent.
arXiv Detail & Related papers (2020-04-30T11:52:12Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.