Pith. sign in

REVIEW 5 cited by

Compiler generated feedback for Large Language Models

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 2403.14714 v1 pith:U7LPSBNZ submitted 2024-03-18 cs.PL cs.LG

classification cs.PLcs.LG
keywords feedbackcodecompilergeneratedoptimizationinputinstructionlanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce a novel paradigm in compiler optimization powered by Large Language Models with compiler feedback to optimize the code size of LLVM assembly. The model takes unoptimized LLVM IR as input and produces optimized IR, the best optimization passes, and instruction counts of both unoptimized and optimized IRs. Then we compile the input with generated optimization passes and evaluate if the predicted instruction count is correct, generated IR is compilable, and corresponds to compiled code. We provide this feedback back to LLM and give it another chance to optimize code. This approach adds an extra 0.53% improvement over -Oz to the original model. Even though, adding more information with feedback seems intuitive, simple sampling techniques achieve much higher performance given 10 or more samples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Can Coding Agents Implement Missed Compiler Optimizations? Evaluating LLM Agents on LLVM Peephole Optimizations

    cs.SE 2026-07 accept novelty 6.5 of 10

    No evaluated coding agent simultaneously matches human experts on behavioral validity and profitability when implementing real missed InstCombine optimizations from LLVM issues.

  2. 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.

  3. NEURA: A Unified and Retargetable Compilation Framework for Coarse-Grained Reconfigurable Architectures

    cs.PL 2026-04 unverdicted novelty 6.0 of 10

    NEURA flattens CGRA control flow into a pure predicated dataflow IR and reports 2.20× kernel and up to 2.71× application speedups over high-performance SOTA baselines.

  4. Bridging the Gap in Ophthalmic AI: MM-Retinal-Reason Dataset and OphthaReason Model toward Dynamic Multimodal Reasoning

    cs.AI 2025-08 unverdicted novelty 6.0 of 10

    A new retinal-imaging multimodal dataset and an ophthalmology-specific reasoning model claim state-of-the-art gains of 15 to 25 percent over existing medical and general multimodal LLMs.

  5. Natural-Language to SysMLv2 Translation via Conformance-Driven Iterative Refinement

    cs.SE 2026-07 conditional novelty 5.0 of 10

    Wrapping LLM generation in a loop that repairs until a production SysMLv2 checker reports zero errors lifts benchmark conformance from 51.16% single-shot to 100%, in at most 8 attempts per case.

Pith tools