Automatic Feature Generation for Machine Learning--based Optimising Compilation

Research output: Contribution to journalArticlepeer-review

Abstract

Recent work has shown that machine learning can automate and in some cases outperform handcrafted compiler optimisations. Central to such an approach is that machine learning techniques typically rely upon summaries or features of the program. The quality of these features is critical to the accuracy of the resulting machine learned algorithm; no machine learning method will work well with poorly chosen features. However, due to the size and complexity of programs, theoretically there are an infinite number of potential features to choose from. The compiler writer now has to expend effort in choosing the best features from this space. This article develops a novel mechanism to automatically find those features that most improve the quality of the machine learned heuristic. The feature space is described by a grammar and is then searched with genetic programming and predictive modelling. We apply this technique to loop unrolling in GCC 4.3.1 and evaluate our approach on a Pentium 6. On a benchmark suite of 57 programs, GCCs hard-coded heuristic achieves only 3% of the maximum performance available, whereas a state-of-the-art machine learning approach with hand-coded features obtains 59%. Our feature generation technique is able to achieve 76% of the maximum available speedup, outperforming existing approaches.
Original languageEnglish
Article number14
Pages (from-to)14:1-14:32
Number of pages32
JournalACM Transactions on Architecture and Code Optimization
Volume11
Issue number1
DOIs
Publication statusPublished - Feb 2014

Keywords

  • Feature generation, genetic programming, program optimisation

Fingerprint Dive into the research topics of 'Automatic Feature Generation for Machine Learning--based Optimising Compilation'. Together they form a unique fingerprint.

Cite this