mlsanityData to 14 Oct 2026

An AO-ADMM approach to constraining PARAFAC2 on all modes

arXiv 2110.01278 ↗First posted 4 Oct 2021cs.LG math.OC stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

Analyzing multi-way measurements with variations across one mode of the dataset is a challenge in various fields including data mining, neuroscience and chemometrics. For example, measurements may evolve over time or have unaligned time profiles. The PARAFAC2 model has been successfully used to analyze such data by allowing the underlying factor matrices in one mode (i.e., the evolving mode) to change across slices. The traditional approach to fit a PARAFAC2 model is to use an alternating least squares-based algorithm, which handles the constant cross-product constraint of the PARAFAC2 model by implicitly estimating the evolving factor matrices. This approach makes imposing regularization on these factor matrices challenging. There is currently no algorithm to flexibly impose such regularization with general penalty functions and hard constraints. In order to address this challenge and to avoid the implicit estimation, in this paper, we propose an algorithm for fitting PARAFAC2 based on alternating optimization with the alternating direction method of multipliers (AO-ADMM). With numerical experiments on simulated data, 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. We also apply our model to two real-world datasets from neuroscience and chemometrics, and show that constraining the evolving mode improves the interpretability of the extracted patterns.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 9 of its 67 references that are in the map. First posted on arXiv 4 Oct 2021.

Builds on

9 of 67 references.

References · 9

  1. 2015A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorizationcited by 30
  2. 2018COPA: Constrained PARAFAC2 for Sparse & Large Datasetscited by 18
  3. 2019Stochastic Gradients for Large-Scale Tensor Decompositioncited by 16
  4. 2014Subspace Learning and Imputation for Streaming Big Data Matrices and Tensorscited by 15
  5. 2018Nonnegative PARAFAC2: a flexible coupling approachcited by 11
  6. 2019Tracing Network Evolution Using the PARAFAC2 Modelcited by 10
  7. 2020A Flexible Optimization Framework for Regularized Matrix-Tensor Factorizations with Linear Couplingscited by 10
  8. 2018Nesterov Acceleration of Alternating Least Squares for Canonical Tensor Decomposition: Momentum Step Size Selection and Restart Mechanismscited by 3
  9. 2021PARAFAC2 AO-ADMM: Constraints in all modescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 3; 2023: 2; 2024: 3; 2025: 2; 2026: 2.

12 papers.