GP-ND adds a log-KL divergence penalty between a GP's predictive distribution and Gaussian blobs placed on negative data pairs, aiming to fit positive points while avoiding obstacles.
AntMan: Sparse Low-Rank Compression to Accelerate RNN inference
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
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.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Obstacle-aware Gaussian Process Regression
GP-ND adds a log-KL divergence penalty between a GP's predictive distribution and Gaussian blobs placed on negative data pairs, aiming to fit positive points while avoiding obstacles.