Pith. sign in

REVIEW 1 cited by

S4: a High-sparsity, High-performance AI Accelerator

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.08006 v1 pith:NX5QDLV3 submitted 2022-07-16 cs.AR cs.LG

classification cs.ARcs.LG
keywords sparsityhigherinferencemodelaccelerationbecomebeenhigh-degree
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Exploiting sparsity underlying neural networks has become one of the most potential methodologies to reduce the memory footprint, I/O cost, and computation workloads during inference. And the degree of sparsity one can exploit has become higher as larger model sizes have been considered along with the trend of pre-training giant models. On the other hand, compared with quantization that has been a widely supported option, acceleration through high-degree sparsity is not supported in most computing platforms. In this work, we introduce the first commercial hardware platform supporting high-degree sparsity acceleration up to 32 times -- S4. Combined with state-of-the-art sparse pruning techniques, we demonstrate several-times practical inference speedup on S4 over mainstream inference platforms such as Nvidia T4. We also show that in practice a sparse model of larger size can achieve both higher accuracy and higher throughput on S4 than a dense model of smaller size.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TriADA: Massively Parallel Trilinear Matrix-by-Tensor Multiply-Add Algorithm and Device Architecture for the Acceleration of 3D Discrete Transformations

    cs.DC 2025-06 conditional novelty 4.0 of 10

    The paper proposes a triple-stage outer-product algorithm and an isomorphic 3D mesh architecture that computes separable 3D orthogonal transforms in N1+N2+N3 time steps.

Pith tools