Learning to Superoptimize Real-world Programs
Not on the map. Why?
Abstract (arXiv)
Program optimization is the process of modifying software to execute more efficiently. Superoptimizers attempt to find the optimal program by employing significantly more expensive search and constraint solving techniques. Generally, these methods do not scale well to programs in real development scenarios, and as a result, superoptimization has largely been confined to small-scale, domain-specific, and/or synthetic program benchmarks. In this paper, we propose a framework to learn to superoptimize real-world programs by using neural sequence-to-sequence models. We created a dataset consisting of over 25K real-world x86-64 assembly functions mined from open-source projects and propose an approach, Self Imitation Learning for Optimization (SILO) that is easy to implement and outperforms a standard policy gradient learning approach on our dataset. Our method, SILO, superoptimizes 5.9% of our test set when compared with the gcc version 10.3 compiler's aggressive optimization level -O3. We also report that SILO's rate of superoptimization on our test set is over five times that of a standard policy gradient approach and a model pre-trained on compiler optimization demonstration.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 12 of its 35 references that are in the map. First posted on arXiv 28 Sep 2021.
Builds on
12 of 35 references.
References · 12
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
- 2017A Survey of Machine Learning for Big Code and Naturalnesscited by 220
- 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 183
- 2018Learning to Optimize Tensor Programscited by 138
- 2018Self-Imitation Learningcited by 135
- 2018Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsingcited by 57
- 2013An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clusteringcited by 17
- 2017Souper: A Synthesizing Superoptimizercited by 12
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
- 2023Learning Performance-Improving Code Editscited by 103
- 2024ECCO: Can We Improve Model-Generated Code Efficiency Without Sacrificing Functional Correctness?cited by 25
- 2026MacroAgent: Regularity-Aware Macro Legalization with LLM-Agent-Designed Contour Algorithmscited by 0
- 2026MacroAgent: Regularity-Aware Macro Legalization with LLM-Agent-Designed Contour Algorithms24 Aug 2026
- 2024ECCO: Can We Improve Model-Generated Code Efficiency Without Sacrificing Functional Correctness?19 Jul 2024
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation2 May 2023
- 2023Learning Performance-Improving Code Edits15 Feb 2023
Similar, not cited
Close in wording, no citation either way
- 2024CompilerDream: Learning a Compiler World Model for General Code Optimization
- 2024Offline Imitation Learning from Multiple Baselines with Applications to Compiler Optimization
- 2026WarmTuner: Program-Specific Warm Starts for Compiler Autotuning via Offline-to-Online Reinforcement Learning ↗
- 2026Reinforcement Learning for Code Optimization
- 2024Should AI Optimize Your Code? A Comparative Study of Classical Optimizing Compilers Versus Current Large Language Models
- 2026Learning to Optimize through Solver-Grounded Self-Play
- 2025Compiler-R1: Towards Agentic Compiler Auto-tuning with Reinforcement Learning
- 2025LPO: Discovering Missed Peephole Optimizations with Large Language Models