Search Results for author:
Found 2 papers, 0 papers with code
Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruning
To achieve this, we propose a novel idea, Magic Pyramid (MP), to reduce both width-wise and depth-wise computation via token pruning and early exiting for Transformer-based models, particularly BERT.
Low-Precision Quantization for Efficient Nearest Neighbor Search
Fast k-Nearest Neighbor search over real-valued vector spaces (KNN) is an important algorithmic task for information retrieval and recommendation systems.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
