Conference item
Learning to superoptimize programs
- Abstract:
- Code super-optimization is the task of transforming any given program to a more efficient version while preserving its input-output behaviour. In some sense, it is similar to the paraphrase problem from natural language processing where the intention is to change the syntax of an utterance without changing its semantics. Code-optimization has been the subject of years of research that has resulted in the development of rule-based transformation strategies that are used by compilers. More recently, however, a class of stochastic search based methods have been shown to outperform these strategies. This approach involves repeated sampling of modifications to the program from a proposal distribution, which are accepted or rejected based on whether they preserve correctness and the improvement they achieve. These methods, however, neither learn from past behaviour nor do they try to leverage the semantics of the program under consideration. Motivated by this observation, we present a novel learning based approach for code super-optimization. Intuitively, our method works by learning the proposal distribution using unbiased estimators of the gradient of the expected improvement. Experiments on benchmarks comprising of automatically generated as well as existing (“Hacker’s Delight”) programs show that the proposed method is able to significantly outperform state of the art approaches for code super-optimization.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 516.8KB, Terms of use)
-
- Publication website:
- https://openreview.net/
Authors
- Publisher:
- OpenReview
- Host title:
- Proceedings of the 5th International Conference on Learning Representations (ICLR 2017)
- Publication date:
- 2017-02-17
- Acceptance date:
- 2017-02-06
- Event title:
- 5th International Conference on Learning Representations (ICLR 2017)
- Event location:
- Toulon, France
- Event website:
- https://iclr.cc/archive/www/doku.php%3Fid=iclr2017:main.html
- Event start date:
- 2017-04-24
- Event end date:
- 2017-04-26
- Language:
-
English
- Pubs id:
-
pubs:810843
- UUID:
-
uuid:2a62d3e6-1728-416c-8de2-a66a8315a444
- Local pid:
-
pubs:810843
- Source identifiers:
-
810843
- Deposit date:
-
2017-12-14
- ARK identifier:
Terms of use
- Copyright holder:
- International Conference on Learning Representations
- Copyright date:
- 2017
- Notes:
- This paper was presented at the 5th International Conference on Learning Representations (ICLR 2017), 24th-26th April 2017, Toulon, France. This is the accepted manuscript version of the article. The final version is available online from OpenReview at: https://openreview.net/forum?id=r1rz6U5lg
If you are the owner of this record, you can report an update to it here: Report update to this record