Pith. sign in

REVIEW 3 cited by

MLGO: a Machine Learning Guided Compiler Optimizations Framework

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.04808 v1 pith:5RDYKHX3 submitted 2021-01-13 cs.PL cs.LG

classification cs.PLcs.LG
keywords compilerllvmreal-worldtechniquesframeworkinlining-for-sizemachinemlgo
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Leveraging machine-learning (ML) techniques for compiler optimizations has been widely studied and explored in academia. However, the adoption of ML in general-purpose, industry strength compilers has yet to happen. We propose MLGO, a framework for integrating ML techniques systematically in an industrial compiler -- LLVM. As a case study, we present the details and results of replacing the heuristics-based inlining-for-size optimization in LLVM with machine learned models. To the best of our knowledge, this work is the first full integration of ML in a complex compiler pass in a real-world setting. It is available in the main LLVM repository. We use two different ML algorithms: Policy Gradient and Evolution Strategies, to train the inlining-for-size model, and achieve up to 7\% size reduction, when compared to state of the art LLVM -Oz. The same model, trained on one corpus, generalizes well to a diversity of real-world targets, as well as to the same set of targets after months of active development. This property of the trained models is beneficial to deploy ML techniques in real-world settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Can Large Language Models Recover Semantic Optimization Opportunities That Compilers Miss?

    cs.PL 2026-08 conditional novelty 6.0 of 10

    On the new SeGaBench benchmark, the strongest of five LLMs recovered compiler-missed optimization semantics and produced validated, speedup-delivering code changes in a large majority of cases.

  2. WarmTuner: Program-Specific Warm Starts for Compiler Autotuning via Offline-to-Online Reinforcement Learning

    cs.SE 2026-07 conditional novelty 6.0 of 10

    WarmTuner learns a source-code-conditioned flag policy offline and refines it online with GRPO, reporting 1.732x average speedup over GCC -O3 but not a significant gain over GroupTuner.

  3. Agentic Harness for Real-World Compilers

    cs.SE 2026-03 conditional novelty 6.0 of 10

    An LLVM-specific harness and agent raise LLM bug-fix pass rates by about 22 percent over a general agent, but expert review shows true capability stays below 22 percent because LLVM's regression tests accept many inco...

Pith tools