Accelerating the tucker decomposition with compressed sparse tensors

S Smith, G Karypis - European Conference on Parallel Processing, 2017 - Springer
The Tucker decomposition is a higher-order analogue of the singular value decomposition
and is a popular method of performing analysis on multi-way data (tensors). Computing the …

Sparse tensor factorization on many-core processors with high-bandwidth memory

S Smith, J Park, G Karypis - 2017 IEEE International Parallel …, 2017 - ieeexplore.ieee.org
HPC systems are increasingly used for data intensive computations which exhibit irregular
memory accesses, non-uniform work distributions, large memory footprints, and high …

Memory-efficient parallel tensor decompositions

M Baskaran, T Henretty, B Pradelle… - 2017 IEEE High …, 2017 - ieeexplore.ieee.org
Tensor decompositions are a powerful technique for enabling comprehensive and complete
analysis of real-world data. Data analysis through tensor decompositions involves intensive …

Parameter estimation and segmentation of noisy or textured images using the EM algorithm and MPM estimation

ML Comer, EJ Delp - … of 1st International Conference on Image …, 1994 - ieeexplore.ieee.org
Presents a new algorithm for segmentation of noisy or textured images using the expectation-
maximization (EM) algorithm for estimating parameters of the probability mass function of the …

Performance considerations for scalable parallel tensor decomposition

TB Rolinger, TA Simon, CD Krieger - Journal of Parallel and Distributed …, 2019 - Elsevier
Tensor decomposition, the higher-order analogue to singular value decomposition, has
emerged as a useful tool for finding relationships in large, sparse, multidimensional data. As …

Performance challenges for heterogeneous distributed tensor decompositions

TB Rolinger, TA Simon… - 2017 IEEE High …, 2017 - ieeexplore.ieee.org
Tensor decompositions, which are factorizations of multi-dimensional arrays, are becoming
increasingly important in large-scale data analytics. A popular tensor decomposition …

The advance of support tensor machine

Y Xiang, Q Jiang, J He, X Jin, LW Wu… - 2018 IEEE 16th …, 2018 - ieeexplore.ieee.org
In recent years, tensor-based machine learning methods, in which the Support Tensor
Machine (STM) is a typical technology, have gradually attracted the attention of researchers …

Efficient Processing of Sparse Tensor Decomposition via Unified Abstraction and PE-Interactive Architecture

B Wang, L Deng, Z Qu, S Li, Z Zhang… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
We propose a novel architecture to efficiently perform sparse tensor decomposition/
completion. As the generalization of vectors and matrices, tensors are widely used to …

Algorithms for Large-Scale Sparse Tensor Factorization

S Smith - 2019 - conservancy.umn.edu
Tensor factorization is a technique for analyzing data that features interactions of data along
three or more axes, or modes. Many fields such as retail, health analytics, and cybersecurity …

[PDF][PDF] Evaluating Communication Costs for Distributed Sparse Tensor Factorization on Multi-GPU Systems

TB Rolinger - researchgate.net
Evaluating Communication Costs for Distributed Sparse Tensor Factorization on Multi-GPU
Systems Page 1 Evaluating Communication Costs for Distributed Sparse Tensor Factorization …