REVIEW 5 cited by
Language Models Can Teach Themselves to Program Better
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
read the original abstract
Recent Language Models (LMs) achieve breakthrough performance in code generation when trained on human-authored problems, even solving some competitive-programming problems. Self-play has proven useful in games such as Go, and thus it is natural to ask whether LMs can generate their own instructive programming problems to improve their performance. We show that it is possible for an LM to synthesize programming problems and solutions, which are filtered for correctness by a Python interpreter. The LM's performance is then seen to improve when it is fine-tuned on its own synthetic problems and verified solutions; thus the model 'improves itself' using the Python interpreter. Problems are specified formally as programming puzzles [Schuster et al., 2021], a code-based problem format where solutions can easily be verified for correctness by execution. In experiments on publicly-available LMs, test accuracy more than doubles. This work demonstrates the potential for code LMs, with an interpreter, to generate instructive problems and improve their own performance.
Forward citations
Cited by 5 Pith papers
-
Toward Training Superintelligent Software Agents through Self-Play SWE-RL
Self-play RL on bug injection and repair in sandboxed repositories yields +10.4 and +7.8 point gains on SWE-bench Verified and Pro while outperforming human-data baselines.
-
AR$^2$: Adversarial Reinforcement Learning for Abstract Reasoning in Large Language Models
Adversarial teacher-student RL on computationally equivalent narrative rewrites of coding problems yields modest but consistent pass@1 gains on competitive programming benchmarks.
-
Dr. Boot: Bootstrapping Program Synthesis Language Models to Perform Repairing
A bootstrapping algorithm that trains program synthesis models on their own successful outputs and on repaired failures modestly improves pass@k over regular fine-tuning on MBPP, with mixed results on APPS.
-
Self-Reasoning Language Models: Unfold Hidden Reasoning Chains with Few Reasoning Catalyst
Self-Reasoning Language Models use 1,000 seed catalyst rationales to teach a model to expand its own reasoning chains and iteratively self-improve, gaining about 2.5 points on average across five benchmarks.
-
Large Language Models for Planning: A Comprehensive and Systematic Survey
A structured survey of LLM planning methods, benchmarks, and interpretability work, organized around a three-way taxonomy.
Discussion (0). Continue with ORCID to comment.