activity
20192025
most citedPL-NMF: Parallel Locality-Optimized Non-negative Matrix Factorization

7 citations · 18 across the 5 of their papers we have counts for

collaborators

5 papers

cs.PF2025★ 1 cited

cuTeSpMM: Accelerating Sparse-Dense Matrix Multiplication using GPU Tensor Cores

Lizhi Xiang, Omid Asudeh, Gerald Sabin +2

Many recent GPUs feature matrix multiplication engines (aka Tensor Core Units or TCUs) that perform small fixed-size matrix-matrix products at very high throughput. They have been…

cs.DC2022★ 2 cited

TDC: Towards Extremely Efficient CNNs on GPUs via Hardware-Aware Tucker Decomposition

Lizhi Xiang, Miao Yin, Chengming Zhang +4

Tucker decomposition is one of the SOTA CNN model compression techniques. However, unlike the FLOPs reduction, we observe very limited inference time reduction with Tucker-compress…

cs.DC2021★ 5 cited

Efficient distributed algorithms for Convolutional Neural Networks

Rui Li, Yufan Xu, Aravind Sukumaran-Rajam +2

Several efficient distributed algorithms have been developed for matrix-matrix multiplication: the 3D algorithm, the 2D SUMMA algorithm, and the 2.5D algorithm. Each of these algor…

cs.LG2019★ 7 cited

PL-NMF: Parallel Locality-Optimized Non-negative Matrix Factorization

Gordon E. Moon, Aravind Sukumaran-Rajam, Srinivasan Parthasarathy +1

Non-negative Matrix Factorization (NMF) is a key kernel for unsupervised dimension reduction used in a wide range of applications, including topic modeling, recommender systems and…

cs.DC2019★ 3 cited

Load-Balanced Sparse MTTKRP on GPUs

Israt Nisa, Jiajia Li, Aravind Sukumaran-Rajam +2

Sparse matricized tensor times Khatri-Rao product (MTTKRP) is one of the most computationally expensive kernels in sparse tensor computations. This work focuses on optimizing the M…