Pith. sign in

REVIEW 1 cited by

DOCE: Finding the Sweet Spot for Execution-Based Code Generation

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 2408.13745 v4 pith:LJNDP7FO submitted 2024-08-25 cs.CL cs.AIcs.PL

classification cs.CLcs.AIcs.PL
keywords codegenerationexecution-baseddecodingframeworkmethodsrerankingbeen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Recently, a diverse set of decoding and reranking procedures have been shown effective for LLM-based code generation. However, a comprehensive framework that links and experimentally compares these methods is missing. We address this by proposing Decoding Objectives for Code Execution, a comprehensive framework that includes candidate generation, $n$-best reranking, minimum Bayes risk (MBR) decoding, and self-debugging as the core components. We then study the contributions of these components through execution-based evaluation metrics. Our findings highlight the importance of execution-based methods and the difference gap between execution-based and execution-free methods. Furthermore, we assess the impact of filtering based on trial unit tests, a simple and effective strategy that has been often overlooked in prior works. We also propose self-debugging on multiple candidates, obtaining state-of-the-art performance on reranking for code generation. We expect our framework to provide a solid guideline for future research on code generation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation

    cs.LG 2026-04 accept novelty 7.0 of 10

    Leave-one-out AUC of each test against the ranking induced by the remaining tests is proportional to that test's latent discriminative power, yielding closed-form and optimized weights that raise Pass@k.

Pith tools