Scalable Tensor Factorizations for Incomplete Data
Evrim Acar, Tamara G. Kolda, Daniel M. Dunlavy, Morten Morup

TL;DR
This paper introduces CP-WOPT, an efficient algorithm for tensor factorization with missing data, capable of handling large-scale, sparse tensors and reconstructing missing entries in various real-world applications.
Contribution
The paper presents CP-WOPT, a scalable first-order optimization method for tensor factorization with missing data, outperforming existing methods in handling high missingness and large-scale tensors.
Findings
Successfully factorizes tensors with up to 99% missing data.
Scales to large sparse tensors with millions of known entries.
Demonstrates effectiveness on EEG and network traffic data.
Abstract
The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, communication networks, etc. We consider the problem of how to factorize data sets with missing values with the goal of capturing the underlying latent structure of the data and possibly reconstructing missing values (i.e., tensor completion). We focus on one of the most well-known tensor factorizations that captures multi-linear structure, CANDECOMP/PARAFAC (CP). In the presence of missing data, CP can be formulated as a weighted least squares problem that models only the known entries. We develop an algorithm called CP-WOPT (CP Weighted OPTimization) that uses a first-order optimization approach to solve the weighted least squares problem. Based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
