CLIRSEApr 13, 2025

Iterative Self-Training for Code Generation via Reinforced Re-Ranking

arXiv:2504.09643v13 citationsh-index: 4ECIR
Originality Incremental advance
AI Analysis

This addresses the problem of stochastic and error-prone code generation for developers, though it appears incremental by building on existing reranking and PPO methods.

The paper tackles the challenge of generating high-quality code by proposing an iterative self-training approach for reranker models using Proximal Policy Optimization, which improves code generation quality and speed, as demonstrated by a 13.4B parameter model outperforming a 33B model and achieving performance comparable to GPT-4.

Generating high-quality code that solves complex programming tasks is challenging, especially with current decoder-based models that produce highly stochastic outputs. In code generation, even minor errors can easily break the entire solution. Leveraging multiple sampled solutions can significantly improve the overall output quality. One effective way to enhance code generation is by pairing a code generation model with a reranker model, which selects the best solution from the generated samples. We propose a novel iterative self-training approach for self-training reranker models using Proximal Policy Optimization (PPO), aimed at improving both reranking accuracy and the overall code generation process. Unlike traditional PPO approaches, where the focus is on optimizing a generative model with a reward model, our approach emphasizes the development of a robust reward/reranking model. This model improves the quality of generated code through reranking and addresses problems and errors that the reward model might overlook during PPO alignment with the reranker. Our method iteratively refines the training dataset by re-evaluating outputs, identifying high-scoring negative examples, and incorporating them into the training loop, that boosting model performance. Our evaluation on the MultiPL-E dataset demonstrates that our 13.4B parameter model outperforms a 33B model in code generation quality while being three times faster. Moreover, it achieves performance comparable to GPT-4 and surpasses it in one programming language.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes