paper-with-me

Papers

FrontierSmith: Synthesizing Open-Ended Coding Problems at Scale

2026-05-14 · Runyuan He, Qiuyang Mang, Shang Zhou, Kaiyuan Liu, Hanchen Li, Huanzhi Mao, Qizheng Zhang, Zerui Li, Bo Peng, Lufeng Cheng, Tianfu Fu, Yichuan Wang, Wenhao Chai, Jingbo Shang, Alex Dimakis, Joseph E. Gonzalez, Alvin Cheung arxiv

Many real-world coding challenges are open-ended and admit no known optimal solution. Yet, recent progress in LLM coding has focused on well-defined tasks such as feature implementation, bug fixing, and competitive programming. Open-ended coding remains a weak spot for LLMs, largely because open-ended training problems are scarce and expensive to construct. Our goal is to synthesize open-ended coding problems at scale to train stronger LLM coders. We introduce FrontierSmith, an automated system for iteratively evolving open-ended problems from existing closed-ended coding tasks. Starting from competitive programming problems, FrontierSmith generates candidate open-ended variants by changing the problems'goals, restricting outputs, and generalizing inputs. It then uses a quantitative idea divergence metric to select problems that elicit genuinely diverse approaches from different solvers. Agents then generate test cases and verifiers for the surviving candidates. On two open-ended coding benchmarks, training on our synthesized data yields substantial gains over the base models: Qwen3.5-9B improves by +8.82 score on FrontierCS and +306.36 (Elo-rating-based performance) on ALE-bench; Qwen3.5-27B improves by +12.12 and +309.12, respectively. The synthesized problems also make agents take more turns and use more tokens, similar to human-curated ones, suggesting that closed-ended seeds can be a practical starting point for long-horizon coding data.

📄 PDF Abstract BibTeX arXiv:2605.14445

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Decoding Decoded: Understanding Hyperparameter Effects in Open-Ended Text Generation

2024-10-08 · Esteban Garces Arias, Meimingwei Li, Christian Heumann, Matthias Aßenmacher

Decoding strategies for generative large language models (LLMs) are a critical but often underexplored aspect of text generation tasks. Guided by specific hyperparameters, these strategies aim to transform the raw probab…

Text Generation

MLPro: A System for Hosting Crowdsourced Machine Learning Challenges for Open-Ended Research Problems

2022-04-04 · Peter Washington, Aayush Nandkeolyar, Sam Yang

The task of developing a machine learning (ML) model for a particular problem is inherently open-ended, and there is an unbounded set of possible solutions. Steps of the ML development pipeline, such as feature engineeri…

Dimensionality ReductionFeature EngineeringImputation

Test Case-Informed Knowledge Tracing for Open-ended Coding Tasks

2024-09-28 · Zhangqi Duan, Nigel Fernandez, Alexander Hicks, Andrew Lan

Open-ended coding tasks, which ask students to construct programs according to certain specifications, are common in computer science education. Student modeling can be challenging since their open-ended nature means tha…

Knowledge TracingLanguage ModelingLanguage ModellingLarge Language Model+1

HardTests: Synthesizing High-Quality Test Cases for LLM Coding

2025-05-30 · Zhongmou He, Yee Man Choi, Kexun Zhang, Jiabao Ji 외

Verifiers play a crucial role in large language model (LLM) reasoning, needed by post-training techniques such as reinforcement learning. However, reliable verifiers are hard to get for difficult coding problems, because…

Code GenerationLanguage ModelingLanguage ModellingLarge Language Model

SwarmResearch: Orchestrating Coding Agents for Open-Ended Discovery

2026-07-02 · Yuvraj Virk, Zack Edds, Chunqiu Steven Xia, Lingming Zhang arxiv

Long-running coding agents such as autoresearch can persistently discover optimizations for open-ended problems. However, they tend to converge onto a single high-level approach, then proceed with low-level edits while m…