High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic

TL;DR

This paper introduces high-performance routines for sparse tensor arithmetic, including a new data structure, a radix-based permutation algorithm, and a poly-algorithm for hyper-sparse tensor products, significantly improving speed and efficiency.

Contribution

It presents novel data structures, algorithms, and a poly-algorithm tailored for sparse tensor arithmetic, addressing challenges of hyper-sparsity and operational complexity.

Findings

Achieves over 40% speed-up compared to existing implementations.

Demonstrates over 10x speed improvements over MATLAB Tensor Toolbox.

Provides practical routines incorporated into LibNT and NTToolbox libraries.

Abstract

Researchers are increasingly incorporating numeric high-order data, i.e., numeric tensors, within their practice. Just like the matrix/vector (MV) paradigm, the development of multi-purpose, but high-performance, sparse data structures and algorithms for arithmetic calculations, e.g., those found in Einstein-like notation, is crucial for the continued adoption of tensors. We use the example of high-order differential operators to illustrate this need. As sparse tensor arithmetic is an emerging research topic, with challenges distinct from the MV paradigm, many aspects require further articulation. We focus on three core facets. First, aligning with prominent voices in the field, we emphasise the importance of data structures able to accommodate the operational complexity of tensor arithmetic. However, we describe a linearised coordinate (LCO) data structure that provides faster and more memory-efficient sorting performance. Second, flexible data structures, like the LCO, rely heavily on sorts and permutations. We introduce an innovative permutation algorithm, based on radix sort, that is tailored to rearrange already-sorted sparse data, producing significant performance gains. Third, we introduce a novel poly-algorithm for sparse tensor products, where hyper-sparsity is a possibility. Different manifestations of hyper-sparsity demand their own approach, which our poly-algorithm is the first to provide. These developments are incorporated within our LibNT and NTToolbox software libraries. Benchmarks, frequently drawn from the high-order differential operators example, demonstrate the practical impact of our routines, with speed-ups of 40% or higher compared to alternative high-performance implementations. Comparisons against the MATLAB Tensor Toolbox show over 10 times speed improvements. Thus, these advancements produce significant practical improvements for sparse tensor arithmetic.