ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
원문 초록
The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain experts to engage in trial-and-error heuristic design. The long-standing endeavor of design automation has gained new momentum with the rise of large language models (LLMs). This paper introduces Language Hyper-Heuristics (LHHs), an emerging variant of Hyper-Heuristics that leverages LLMs for heuristic generation, featuring minimal manual intervention and open-ended heuristic spaces. To empower LHHs, we present Reflective Evolution (ReEvo), a novel integration of evolutionary search for efficiently exploring the heuristic space, and LLM reflections to provide verbal gradients within the space. Across five heterogeneous algorithmic types, six different COPs, and both white-box and black-box views of COPs, ReEvo yields state-of-the-art and competitive meta-heuristics, evolutionary algorithms, heuristics, and neural solvers, while being more sample-efficient than prior LHHs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Learnable Evolutionary Multi-Objective Combinatorial Optimization via Sequence-to-Sequence Model
Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization
Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization
Pareto Optimization with Robust Evaluation for Noisy Subset Selection
Selection of Filters for Photonic Crystal Spectrometer Using Domain-Aware Evolutionary Algorithms
토론
이 논문과 연결된 포럼 글이 아직 없습니다.