English

CodeLutra: Boosting LLM Code Generation via Preference-Guided Refinement

Computation and Language 2025-06-27 v3

Abstract

Large Language Models (LLMs) have revolutionized code generation but require significant resources and often over-generalize, limiting their task-specific efficiency. Fine-tuning smaller, open-source LLMs provides a cost-effective alternative. However, standard supervised approaches rely only on correct examples, missing valuable insights from failures. We introduce CodeLutra, a framework that leverages both correct and incorrect code attempts. Instead of using only correct solutions, CodeLutra applies iterative preference-based refinement, comparing successful and failed outputs to better approximate desired results. This approach narrows the performance gap with state-of-the-art larger models without requiring massive datasets or auxiliary models. For instance, on a challenging data science coding task, using only 500 samples improved Llama-3-8B's accuracy from 28.2% to 48.6%, approaching GPT-4's level. By learning from both successes and mistakes, CodeLutra provides a scalable and efficient path to high-quality code generation, making smaller open-source models more competitive with leading closed-source alternatives.

Keywords

Cite

@article{arxiv.2411.05199,
  title  = {CodeLutra: Boosting LLM Code Generation via Preference-Guided Refinement},
  author = {Leitian Tao and Xiang Chen and Tong Yu and Tung Mai and Ryan Rossi and Yixuan Li and Saayan Mitra},
  journal= {arXiv preprint arXiv:2411.05199},
  year   = {2025}
}

Comments

TMLR 2025

R2 v1 2026-06-28T19:52:25.525Z