Code Generation by Differential Test Time Scaling
The article introduces DiffCodeGen, a new method for code generation that enhances efficiency through coverage-guided differential analysis. Unlike existing methods, DiffCodeGen does not rely on public test cases or extensive model inference, significantly reducing token consumption and time overhead. The evaluation shows that DiffCodeGen outperforms or matches state-of-the-art methods while being model-agnostic and scalable.
- ▪DiffCodeGen generates diverse code candidates using sampling and prompting strategies.
- ▪It applies coverage-guided fuzzing to synthesize inputs without existing tests or large language models.
- ▪The method captures dynamic behavior and clusters candidates based on similarity, selecting the medoid of the largest cluster as the output.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.20473 |
| Publication time | Fri, 22 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-22T04:02:00.009Z |
| Last seen | 2026-05-22T04:02:00.009Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 1-wHMyuH2x-q |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Software Engineering arXiv:2605.20473 (cs) [Submitted on 19 May 2026] Title:Code Generation by Differential Test Time Scaling Authors:Yifeng He, Ethan Wang, Jicheng Wang, Xuanxin Ouyang, Hao Chen View a PDF of the paper titled Code Generation by Differential Test Time Scaling, by Yifeng He and 4 other authors View PDF Abstract:Test-time scaling has emerged as a promising approach for improving code generation by exploring large solution spaces at inference time. However, existing methods often rely on public test cases that are unavailable in practice, or require extensive LLM inference for candidate selection, leading to significant token consumption and time overhead.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
