Pith. sign in

REVIEW 10 cited by

Afterburner: Reinforcement Learning Facilitates Self-Improving Code Efficiency Optimization

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 2505.23387 v3 pith:Y73VMJFI submitted 2025-05-29 cs.SE cs.AI

Afterburner: Reinforcement Learning Facilitates Self-Improving Code Efficiency Optimization

classification cs.SE cs.AI
keywords codeefficiencyoptimizationllmsexecutionfeedbackgrpolearning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Large Language Models (LLMs) generate functionally correct solutions but often fall short in code efficiency, a critical bottleneck for real-world deployment. In this paper, we introduce a novel test-time iterative optimization framework to address this, employing a closed-loop system where LLMs iteratively refine code based on empirical performance feedback from an execution sandbox. We explore three training strategies: Supervised Fine-Tuning (SFT), Direct Preference Optimization (DPO), and Group Relative Policy Optimization (GRPO). Experiments on our Venus dataset and the APPS benchmark show that SFT and DPO rapidly saturate in efficiency gains. In contrast, GRPO, using reinforcement learning (RL) with execution feedback, continuously optimizes code performance, significantly boosting both pass@1 (from 47% to 62%) and the likelihood of outperforming human submissions in efficiency (from 31% to 45%). Our work demonstrates effective test-time code efficiency improvement and critically reveals the power of RL in teaching LLMs to truly self-improve code efficiency.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

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

  1. SkelDPO: A Skeleton-Guided Direct Preference Optimization Framework for Efficient Code Generation

    cs.SE 2026-06 unverdicted novelty 7.0

    SkelDPO improves code generation efficiency by 2-7% over prior DPO methods via joint preference losses on full code and efficiency-critical skeletons.

  2. Extrapolative Weight Averaging Reveals Correctness-Efficiency Frontiers in Code RL

    cs.LG 2026-05 conditional novelty 7.0

    Extrapolative weight averaging of RL checkpoints trained under nested unit-test coverage extends a correctness-efficiency frontier and boosts ensemble pass rates in code generation across model scales and inference modes.

  3. From Trainee to Trainer: LLM-Designed Training Environment for RL with Multi-Agent Reasoning

    cs.CL 2026-06 unverdicted novelty 6.0

    The LLM-as-Environment-Engineer framework lets the policy model redesign its own RL environments on the new MAPF-FrozenLake testbed, outperforming larger models and fixed baselines with Qwen3-4B.

  4. Attention Amnesia in Hybrid LLMs: When CoT Fine-Tuning Breaks Long-Range Recall, and How to Fix It

    cs.CL 2026-06 conditional novelty 6.0

    CoT SFT disrupts long-range routing in hybrid models via changes to W_Q and W_K; QK-Restore restores pre-SFT projections to recover NIAH performance.

  5. Chiseling Out Efficiency: Structured Skeleton Supervision for Efficient Code Generation

    cs.SE 2026-06 unverdicted novelty 6.0

    EffiSkel improves LLM-generated code efficiency by supervising on extracted structural efficiency skeletons via multi-task learning of code generation and skeleton prediction.

  6. AutoVecCoder: Teaching LLMs to Generate Explicitly Vectorized Code

    cs.CL 2026-05 unverdicted novelty 6.0

    AutoVecCoder combines VecPrompt for automated intrinsic knowledge synthesis and VecRL for efficiency-aligned RL to train an 8B LLM that achieves SOTA on SimdBench SSE/AVX subsets and sometimes exceeds -O3 compiler results.

  7. Paper Espresso: From Paper Overload to Research Insight

    cs.DL 2026-04 unverdicted novelty 6.0

    Paper Espresso deploys LLMs to summarize and analyze trends across 13,300+ arXiv papers over 35 months, releasing metadata that shows non-saturating topic growth and higher engagement for novel topics.

  8. ParEVO: Synthesizing Code for Irregular Data: High-Performance Parallelism through Agentic Evolution

    cs.LG 2026-03 conditional novelty 6.0

    A pipeline of fine-tuned LLMs plus evolutionary repair produces parallel code for irregular workloads that the authors measure as ~13.6x faster on graph kernels and up to 4.1x faster than a human expert on Maximal Ind...

  9. An Initial Exploration of Contrastive Prompt Tuning to Generate Energy-Efficient Code

    cs.LG 2026-03 unverdicted novelty 5.0

    Contrastive Prompt Tuning raises code accuracy on two of three tested models but produces inconsistent energy-efficiency gains that depend on model, language, and task.

  10. A Survey of Reinforcement Learning for Large Reasoning Models

    cs.CL 2025-09 accept novelty 3.0

    A survey compiling RL methods, challenges, data resources, and applications for enhancing reasoning in large language models and large reasoning models since DeepSeek-R1.