mlsanityData to 7 Oct 2026

COPA: Constrained PARAFAC2 for Sparse & Large Datasets

arXiv 1803.04572 ↗First posted 12 Mar 2018cs.LG stat.MLcited by 18

Not on the map. Why?

Abstract (arXiv)

PARAFAC2 has demonstrated success in modeling irregular tensors, where the tensor dimensions vary across one of the modes. An example scenario is modeling treatments across a set of patients with the varying number of medical encounters over time. Despite recent improvements on unconstrained PARAFAC2, its model factors are usually dense and sensitive to noise which limits their interpretability. As a result, the following open challenges remain: a) various modeling constraints, such as temporal smoothness, sparsity and non-negativity, are needed to be imposed for interpretable temporal modeling and b) a scalable approach is required to support those constraints efficiently for large datasets. To tackle these challenges, we propose a it COnstrained it PARAFAC2 (COPA) method, which carefully incorporates optimization constraints such as temporal smoothness, sparsity, and non-negativity in the resulting factors. To efficiently support all those constraints, COPA adopts a hybrid optimization framework using alternating optimization and alternating direction method of multiplier (AO-ADMM). As evaluated on large electronic health record (EHR) datasets with hundreds of thousands of patients, COPA achieves significant speedups (up to 36 times faster) over prior PARAFAC2 approaches that only attempt to handle a subset of the constraints that COPA enables. Overall, our method outperforms all the baselines attempting to handle a subset of the constraints in terms of speed, while achieving the same level of accuracy. Through a case study on temporal phenotyping of medically complex children, we demonstrate how the constraints imposed by COPA reveal concise phenotypes and meaningful temporal profiles of patients. The clinical interpretation of both the phenotypes and the temporal profiles was confirmed by a medical expert.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Mar 2018.

Builds on

No reference list yet.

Built on by

Cited by year

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

18 papers.

Sort:

  1. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  2. 2024ShiftAddLLM: Accelerating Pretrained LLMs via Post-Training Multiplication-Less Reparameterizationcited by 27
  3. 2023ZeroQuant(4+2): Redefining LLMs Quantization with a New FP6-Centric Strategy for Diverse Generative Taskscited by 14
  4. 2022DeepSpeed Data Efficiency: Improving Deep Learning Model Quality and Training Efficiency via Efficient Data Sampling and Routingcited by 13
  5. 2021An AO-ADMM approach to constraining PARAFAC2 on all modescited by 12
  6. 2022Random-LTD: Random and Layerwise Token Dropping Brings Efficient Training for Large-scale Transformerscited by 11
  7. 2022DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense Tensorscited by 4
  8. 2022Unsupervised EHR-based Phenotyping via Matrix and Tensor Decompositionscited by 4
  9. 2025D-Tracker: Modeling Interest Diffusion in Social Activity Tensor Data Streamscited by 4
  10. 2025Revisiting Large Language Model Pruning using Neuron Semantic Attributioncited by 3
  11. 2021PARAFAC2 AO-ADMM: Constraints in all modescited by 2
  12. 2022MULTIPAR: Supervised Irregular Tensor Factorization with Multi-task Learningcited by 2
6 more
  1. 2023Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors -- Algorithm and Applicationcited by 1
  2. 2023SWoTTeD: An Extension of Tensor Decomposition to Temporal Phenotypingcited by 1
  3. 2024PARAFAC2-based Coupled Matrix and Tensor Factorizations with Constraintscited by 1
  4. 2024tPARAFAC2: Tracking evolving patterns in (incomplete) temporal datacited by 1
  5. 2025Toward Temporal Causal Representation Learning with Tensor Decompositioncited by 1
  6. 2022Modeling and Mining Multi-Aspect Graphs With Scalable Streaming Tensor Decompositioncited by 0