Tree-of-Evolution: Tree-Structured Instruction Evolution for Code Generation in Large Language Models

Data synthesis has become a crucial research area in large language models (LLMs), especially for generating high-quality instruction fine-tuning data to enhance downstream performance.In code generation, a key application of LLMs, manual annotation of code instruction data is costly.Recent methods, such as Code Evol-Instruct and OSS-Instruct, leverage LLMs to synthesize large-scale code instruction data, significantly improving LLM coding capabilities.However, these approaches face limitations due to unidirectional synthesis and randomness-driven generation, which restrict data quality and diversity.To overcome these challenges, we introduce Tree-of-Evolution (ToE), a novel framework that models code instruction synthesis process with a tree structure, exploring multiple evolutionary paths to alleviate the constraints of unidirectional generation.Additionally, we propose optimizationdriven evolution, which refines each generation step based on the quality of the previous iteration.Experimental results across five widely-used coding benchmarks-HumanEval, MBPP, EvalPlus, LiveCodeBench, and Big-CodeBench-demonstrate that base models fine-tuned on just 75k data synthesized by our method achieve comparable or superior performance to the state-of-the-art open-weight Code LLM, Qwen2.5-Coder-Instruct, which was finetuned on millions of samples.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.acl-long.14
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tree-of-Evolution: Tree-Structured Instruction Evolution for Code Generation in Large Language Models

Mohan Kankanhalli, Ziyang Luo, Kaixin Li, Hongzhan Lin et al.
Natural Language Processing Techniques
article

Tree-of-Evolution: Tree-Structured Instruction Evolution for Code Generation in Large Language Models

Mohan Kankanhalli, Ziyang Luo, Kaixin Li, Hongzhan Lin, Yuchen Tian, Jing Ma
article en

Abstract

Data synthesis has become a crucial research area in large language models (LLMs), especially for generating high-quality instruction fine-tuning data to enhance downstream performance.In code generation, a key application of LLMs, manual annotation of code instruction data is costly.Recent methods, such as Code Evol-Instruct and OSS-Instruct, leverage LLMs to synthesize large-scale code instruction data, significantly improving LLM coding capabilities.However, these approaches face limitations due to unidirectional synthesis and randomness-driven generation, which restrict data quality and diversity.To overcome these challenges, we introduce Tree-of-Evolution (ToE), a novel framework that models code instruction synthesis process with a tree structure, exploring multiple evolutionary paths to alleviate the constraints of unidirectional generation.Additionally, we propose optimizationdriven evolution, which refines each generation step based on the quality of the previous iteration.Experimental results across five widely-used coding benchmarks-HumanEval, MBPP, EvalPlus, LiveCodeBench, and Big-CodeBench-demonstrate that base models fine-tuned on just 75k data synthesized by our method achieve comparable or superior performance to the state-of-the-art open-weight Code LLM, Qwen2.5-Coder-Instruct, which was finetuned on millions of samples.

Hong Kong Baptist University (HK)
Tencent
Quality Education
Openalex Percentile: Top 90%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.