mlsanityData to 7 Oct 2026

Pruner: A Draft-then-Verify Exploration Mechanism to Accelerate Tensor Program Tuning

arXiv 2402.02361 ↗First posted 4 Feb 2024cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Tensor program tuning is essential for the efficient deployment of deep neural networks. Search-based approaches have demonstrated scalability and effectiveness in automatically finding high-performance programs for specific hardware. However, the search process is often inefficient, taking hours or even days to discover optimal programs due to the exploration mechanisms guided by an accurate but slow-learned cost model. Meanwhile, the learned cost model trained on one platform cannot seamlessly adapt online to another, which we call cross-platform online unawareness. In this work, we propose Pruner and MoA-Pruner. Pruner is a "Draft-then-Verify" exploration mechanism that accelerates the schedule search process. Instead of applying the complex learned cost model to all explored candidates, Pruner drafts small-scale potential candidates by introducing a naive Symbol-based Analyzer (draft model), then identifies the best candidates by the learned cost model. MoA-Pruner introduces a Momentum online Adaptation strategy to address the cross-platform online unawareness. We incorporate Pruner into the TVM and conduct extensive experiments on three GPU-based platforms. Results show considerable speedup in schedule search time. In online tuning scenarios, Pruner and MoA-Pruner achieve an average speedup of 2.6 × and 4.82 × compared to Ansor. In offline tuning scenarios, Pruner achieves an average speedup of 4.75 × and 4.05× compared to TenSet and TLP, respectively. Furthermore, Pruner achieves an average speedup of 4.08 × compared to MetaSchedule on TensorCore.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 55 references that are in the map. First posted on arXiv 4 Feb 2024.

Builds on

23 of 55 references.

References · 23

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  6. 2020End-to-End Object Detection with Transformerscited by 7,384
  7. 2016Densely Connected Convolutional Networkscited by 6,691
  8. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  9. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  10. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  11. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  12. 2016Wide Residual Networkscited by 3,057
11 more
  1. 2020Exploring Simple Siamese Representation Learningcited by 2,853
  2. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  3. 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,154
  4. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
  5. 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 199
  6. 2015Fast Algorithms for Convolutional Neural Networkscited by 102
  7. 2018Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Codecited by 53
  8. 2021A Deep Learning Based Cost Model for Automatic Code Optimizationcited by 33
  9. 2022Tensor Program Optimization with Probabilistic Programscited by 30
  10. 2021Bolt: Bridging the Gap between Auto-tuners and Hardware-native Performancecited by 18
  11. 2022TLP: A Deep Learning-based Cost Model for Tensor Program Tuningcited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.