HackerPapers

arXiv:2402.08699cs.SE

Unsupervised Evaluation of Code LLMs with Round-Trip Correctness

Miltiadis Allamanis, Sheena Panthaplackel, Pengcheng Yin

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

To evaluate code large language models (LLMs), research has relied on a few small manually curated benchmarks, such as HumanEval and MBPP, which represent a narrow part of the real-world software domains. In this work, we introduce round-trip correctness (RTC) as an alternative evaluation method. RTC allows Code LLM evaluation on a broader spectrum of real-world software domains without the need for costly human curation. RTC rests on the idea that we can ask a model to make a prediction (e.g., describe some code using natural language), feed that prediction back (e.g., synthesize code from the predicted description), and check if this round-trip leads to code that is semantically equivalent to the original input. We show how to employ RTC to evaluate code synthesis and editing. We find that RTC strongly correlates with model performance on existing narrow-domain code synthesis benchmarks while allowing us to expand to a much broader set of domains and tasks which was not previously possible without costly human annotations.

arXiv comments
Published in ICML 2024
Journal reference
DOI
Subjects
cs.SESoftware Engineering cs.LGMachine Learning

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jul 2026 to Jul 2026. Found in 2 HN submissions from Feb 2024 to Sep 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Also see; Unsupervised Evaluation of Code LLMs with Round-Trip Correctness - https://arxiv.org/abs/2402.08699 Code repository for the above - https://github.com/google-deepmind/icml2024-roundtrip-correc... RTCE: RoundTrip Code Evaluation Framework…

      rramadassView on HNParent context

Submitted to Hacker News

  • Unsupervised Evaluation of Code LLMs with Round-Trip Correctness
  • Help Finding LLM and Proof Based Refactoring Reference

    Recently on HN I came across an LLM paper achieving impressive results on SWE-bench refactoring tasks. In addition to generating the refactoring, it also created a formal proof of equivalence in a special DSL. Now I can't seem to find the paper! So far, I have scrubbed the HN SWE-bench articles from the last 9 months, and tried Google scholar searches for LLM based refactoring with Proofs or DSLs. I am confident that they mention SWE-bench in the abstract, but it does not seem to be mentioned…

Connected through shared HN threads, not inferred similarity or a recommendation.