DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense Tensors

• URL: http://arxiv.org/abs/2203.12798v1
• Date: Thu, 24 Mar 2022 01:43:13 GMT
• Title: DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense Tensors
• Abstract summary: We propose DPar2, a fast and scalable PARAFAC2 decomposition method for irregular dense tensors. Extensive experiments show that DPar2 is up to 6.0x faster than competitors on real-world irregular tensors.
• Score: 29.072651980087713
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given an irregular dense tensor, how can we efficiently analyze it? An irregular tensor is a collection of matrices whose columns have the same size and rows have different sizes from each other. PARAFAC2 decomposition is a fundamental tool to deal with an irregular tensor in applications including phenotype discovery and trend analysis. Although several PARAFAC2 decomposition methods exist, their efficiency is limited for irregular dense tensors due to the expensive computations involved with the tensor. In this paper, we propose DPar2, a fast and scalable PARAFAC2 decomposition method for irregular dense tensors. DPar2 achieves high efficiency by effectively compressing each slice matrix of a given irregular tensor, careful reordering of computations with the compression results, and exploiting the irregularity of the tensor. Extensive experiments show that DPar2 is up to 6.0x faster than competitors on real-world irregular tensors while achieving comparable accuracy. In addition, DPar2 is scalable with respect to the tensor size and target rank.

Related papers

• Coupled Tensor-Tensor Completion Method with Applications in Drug Repurposing [0.0]
  We introduce a novel framework to incorporate side information in the form of tensors.<n>We show that Coupled-Tensor Completion (CTTC) demonstrates superior run-time and RSE tensor completion accuracy on two benchmark datasets.
  arXiv  Detail & Related papers  (2026-09-02T22:14:54Z)
• Structure-Preserving Nonlinear Sufficient Dimension Reduction for Tensors [8.679002268074683]
  We introduce two nonlinear sufficient dimension reduction methods for regressions with tensor-valued predictors.<n>Our goal is two-fold: the first is to preserve the tensor structure when performing dimension reduction, particularly the meaning of the tensor modes, for improved interpretation.<n>The second is to substantially reduce the number of parameters in dimension reduction, thereby achieving model parsimony and enhancing estimation accuracy.
  arXiv  Detail & Related papers  (2025-12-23T05:19:16Z)
• Tensor Decomposition Networks for Fast Machine Learning Interatomic Potential Computations [63.945006006152035]
  tensor decomposition networks (TDNs) achieve competitive performance with dramatic speedup in computations.<n>We evaluate TDNs on PubChemQCR, a newly curated molecular relaxation dataset containing 105 million DFT-calculated snapshots.
  arXiv  Detail & Related papers  (2025-07-01T18:46:27Z)
• Score-Based Model for Low-Rank Tensor Recovery [49.158601255093416]
  Low-rank tensor decompositions (TDs) provide an effective framework for multiway data analysis.<n>Traditional TD methods rely on predefined structural assumptions, such as CP or Tucker decompositions.<n>We propose a score-based model that eliminates the need for predefined structural or distributional assumptions.
  arXiv  Detail & Related papers  (2025-06-27T15:05:37Z)
• Unlocking Data-free Low-bit Quantization with Matrix Decomposition for KV Cache Compression [87.5604418100301]
  Key-value( KV) caching is an important technique to accelerate the inference of large language models. Existing methods often compromise precision or require extra data for calibration. We introduce textbfDecoQuant, a novel data-free low-bit quantization technique based on tensor decomposition methods.
  arXiv  Detail & Related papers  (2024-05-21T08:35:10Z)
• Scalable CP Decomposition for Tensor Learning using GPU Tensor Cores [47.87810316745786]
  We propose a compression-based tensor decomposition framework, namely the exascale-tensor, to support exascale tensor decomposition. Compared to the baselines, the exascale-tensor supports 8,000x larger tensors and a speedup up to 6.95x. We also apply our method to two real-world applications, including gene analysis and tensor layer neural networks.
  arXiv  Detail & Related papers  (2023-11-22T21:04:59Z)
• Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors -- Algorithm and Application [25.241802754640958]
  We propose Dash, an efficient and accurate PARAFAC2 decomposition method working in the dual-way streaming setting. Dash achieves 14.0x faster speed than existing PARAFAC2 decomposition methods for newly arrived data. We also provide discoveries for detecting anomalies in real-world datasets, including Subprime Mortgage Crisis and COVID-19.
  arXiv  Detail & Related papers  (2023-05-28T05:56:47Z)
• Error Analysis of Tensor-Train Cross Approximation [88.83467216606778]
  We provide accuracy guarantees in terms of the entire tensor for both exact and noisy measurements. Results are verified by numerical experiments, and may have important implications for the usefulness of cross approximations for high-order tensors.
  arXiv  Detail & Related papers  (2022-07-09T19:33:59Z)
• Monarch: Expressive Structured Matrices for Efficient and Accurate Training [64.6871423399431]
  Large neural networks excel in many domains, but they are expensive to train and fine-tune. A popular approach to reduce their compute or memory requirements is to replace dense weight matrices with structured ones. We propose a class of matrices (Monarch) that is hardware-efficient.
  arXiv  Detail & Related papers  (2022-04-01T17:37:29Z)
• 2D+3D facial expression recognition via embedded tensor manifold regularization [16.98176664818354]
  A novel approach via embedded tensor manifold regularization for 2D+3D facial expression recognition (FERETMR) is proposed. We establish the first-order optimality condition in terms of stationary points, and then design a block coordinate descent (BCD) algorithm with convergence analysis. Numerical results on BU-3DFE database and Bosphorus databases demonstrate the effectiveness of our proposed approach.
  arXiv  Detail & Related papers  (2022-01-29T06:11:00Z)
• Tensor Full Feature Measure and Its Nonconvex Relaxation Applications to Tensor Recovery [1.8899300124593645]
  We propose a new tensor sparsity measure called Full Feature Measure (FFM) It can simultaneously describe the feature dimension each dimension, and connect the Tucker rank with the tensor tube rank. Two efficient models based on FFM are proposed, and two Alternating Multiplier Method (ADMM) algorithms are developed to solve the proposed model.
  arXiv  Detail & Related papers  (2021-09-25T01:44:34Z)
• Efficient Tensor Completion via Element-wise Weighted Low-rank Tensor Train with Overlapping Ket Augmentation [18.438177637687357]
  We propose a novel tensor completion approach via the element-wise weighted technique. We specifically consider the recovery quality of edge elements from adjacent blocks. Our experimental results demonstrate that the proposed algorithm TWMac-TT outperforms several other competing tensor completion methods.
  arXiv  Detail & Related papers  (2021-09-13T06:50:37Z)
• MTC: Multiresolution Tensor Completion from Partial and Coarse Observations [49.931849672492305]
  Existing completion formulation mostly relies on partial observations from a single tensor. We propose an efficient Multi-resolution Completion model (MTC) to solve the problem.
  arXiv  Detail & Related papers  (2021-06-14T02:20:03Z)
• Spectral Learning on Matrices and Tensors [74.88243719463053]
  We show that tensor decomposition can pick up latent effects that are missed by matrix methods. We also outline computational techniques to design efficient tensor decomposition methods.
  arXiv  Detail & Related papers  (2020-04-16T22:53:00Z)

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.