AntMan: Sparse Low-Rank Compression to Accelerate RNN inference
Not on the map. Why?
Abstract (arXiv)
Wide adoption of complex RNN based models is hindered by their inference performance, cost and memory requirements. To address this issue, we develop AntMan, combining structured sparsity with low-rank decomposition synergistically, to reduce model computation, size and execution time of RNNs while attaining desired accuracy. AntMan extends knowledge distillation based training to learn the compressed models efficiently. Our evaluation shows that AntMan offers up to 100x computation reduction with less than 1pt accuracy drop for language and machine reading comprehension models. Our evaluation also shows that for a given accuracy target, AntMan produces 5x smaller models than the state-of-art. Lastly, we show that AntMan offers super-linear speed gains compared to theoretical speedup, demonstrating its practical value on commodity hardware.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 1.
4 papers.
- 2022Neural Graphical Modelscited by 11
- 2023Neural Graph Revealerscited by 3
- 2023Knowledge Propagation over Conditional Independence Graphscited by 0
- 2024Obstacle-aware Gaussian Process Regressioncited by 0
- 2024Obstacle-aware Gaussian Process Regression9 Dec 2024
- 2023Knowledge Propagation over Conditional Independence Graphs10 Aug 2023
- 2023Neural Graph Revealers27 Feb 2023
- 2022Neural Graphical Models2 Oct 2022