LoopTune: Optimizing Tensor Computations with Reinforcement Learning

Dejan Grubisic, Bram Wasti, Chris Cummins, John Mellor-Crummey, Aleksandar Zlateski
9/4/2023
cs.LGcs.PL

No confident code implementation found for this paper.

Abstract

Advanced compiler technology is crucial for enabling machine learning applications to run on novel hardware, but traditional compilers fail to deliver performance, popular auto-tuners have long search times and expert-optimized libraries introduce unsustainable costs. To address this, we developed LoopTune, a deep reinforcement learning compiler that optimizes tensor computations in deep learning models for the CPU. LoopTune optimizes tensor traversal order while using the ultra-fast lightweight code generator LoopNest to perform hardware-specific optimizations. With a novel graph-based representation and action space, LoopTune speeds up LoopNest by 3.2x, generating an order of magnitude faster code than TVM, 2.8x faster than MetaSchedule, and 1.08x faster than AutoTVM, consistently performing at the level of the hand-tuned library Numpy. Moreover, LoopTune tunes code in order of seconds.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{grubisic2023looptune,
  title  = {LoopTune: Optimizing Tensor Computations with Reinforcement Learning},
  author = {Dejan Grubisic and Bram Wasti and Chris Cummins and John Mellor-Crummey and Aleksandar Zlateski},
  year   = {2023},
  eprint = {2309.01825},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.01825v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.01825.svg)](https://codeofpaper.com/paper/2309.01825)

Discussion