用大模型引导进化算法,高效生成更优可解释决策树
Decision Tree Induction Through LLMs via Semantically-Aware Evolution
- 用大模型提供语义先验,改进遗传算子的搜索方向
- 在多个基准上优于现有方法,且搜索效率显著提升
- 适合需要高可解释性与性能的医疗、金融等场景
决策树是具有强预测能力与内在可解释性的关键模型,广泛应用于医疗、金融和物流等领域。然而,现有树生成方法存在贪心策略导致次优解,或精确优化方法计算成本高、适用性有限等问题。为此,我们提出一种基于遗传编程的进化优化方法。核心创新在于将语义先验和领域知识融入搜索过程。提出\texttt{LLEGO}框架,通过大语言模型(LLM)驱动结构化自然语言提示,实现语义感知的遗传操作。引入\textit{适应度引导}交叉以聚焦高性能区域,以及\textit{多样性引导}变异以高效探索全局空间。通过可调节超参数实现探索与利用的精细平衡。实证表明,在多个基准测试中,\texttt{LLEGO}生成的决策树性能优于现有方法,且相比传统遗传编程显著提升搜索效率。
原文摘要 · Abstract (English)
Decision trees are a crucial class of models offering robust predictive performance and inherent interpretability across various domains, including healthcare, finance, and logistics. However, current tree induction methods often face limitations such as suboptimal solutions from greedy methods or prohibitive computational costs and limited applicability of exact optimization approaches. To address these challenges, we propose an evolutionary optimization method for decision tree induction based on genetic programming (GP). Our key innovation is the integration of semantic priors and domain-specific knowledge about the search space into the optimization algorithm. To this end, we introduce $\texttt{LLEGO}$, a framework that incorporates semantic priors into genetic search operators through the use of Large Language Models (LLMs), thereby enhancing search efficiency and targeting regions of the search space that yield decision trees with superior generalization performance. This is operationalized through novel genetic operators that work with structured natural language prompts, effectively utilizing LLMs as conditional generative models and sources of semantic knowledge. Specifically, we introduce $\textit{fitness-guided}$ crossover to exploit high-performing regions, and $\textit{diversity-guided}$ mutation for efficient global exploration of the search space. These operators are controlled by corresponding hyperparameters that enable a more nuanced balance between exploration and exploitation across the search space. Empirically, we demonstrate across various benchmarks that $\texttt{LLEGO}$ evolves superior-performing trees compared to existing tree induction methods, and exhibits significantly more efficient search performance compared to conventional GP approaches.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。