Jul 2026· Proceedings of the Genetic and Evolutionary Computation Conference Companion· 0 citations· 4 references
TL;DR
OptiMerge is proposed, a novel multi-objective evolutionary framework tailored for LLM model merging that discovers well-structured Pareto fronts and achieves improved performance trade-offs compared to base models and grid-search baselines.
Abstract
Model merging aims to combine multiple task-specialized models into a single large language model (LLM). However, existing approaches lack effective strategies for optimizing high-dimensional merging configurations under multiple conflicting objectives and expensive evaluation budgets. In this work, we propose OptiMerge, a novel multi-objective evolutionary framework tailored for LLM model merging. OptiMerge optimizes merging configurations using a multi-objective formulation, where task accuracies serve as objectives and layer-wise merging parameters as decision variables. To improve evaluation efficiency, we propose a proxy-guided screening operator that integrates lightweight proxy signals into the selection process to eliminate low-quality candidates before expensive task evaluations. Integrated into the evolutionary cycle, this operator enables evaluation-efficient population evolution while preserving Pareto diversity. Experiments using Task Arithmetic and TIES-Merging on Mistral-7B models show that OptiMerge discovers well-structured Pareto fronts and achieves improved performance trade-offs compared to base models and grid-search baselines.
Results show that multi-objective Bayesian optimization is valuable as a search layer for expressive merge parameterizations in model merging and introduce MOBO-Merge, a merge-operator agnostic framework that uses multi-objective Bayesian optimization to approximate the Pareto front under a limited evaluation budget.
Utkarsh Agarwal, V. Bonagiri, Raul Astudillo et al.· 0 citations
Large Language Models (LLMs) are opening new directions for automated heuristic design (AHD), allowing evolutionary methods to create and enhance heuristics for constrained optimization problems (COPs). However, most existing approaches face the challenge of the exploration-exploitation balance, where the evolution nee...
Nam Do Khanh, Nhat Nguyen Tran Minh, Dat Pham Vu Tuan et al.· Proceedings of the Genetic a...· 1 citation
This work proposes a general LES framework that incorporates feature-assisted niche construction within abstract search spaces, enabling the seamless integration of niche-based search strategies from evolutionary computation and introduces PartEvo (Partition to Evolve), an LES method that combines niche collaborative s...
Qinglong Hu, Qingfu Zhang· Neural Information Processin...· 10 citations· ⚡3
Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural...
Large language model-based automated heuristic design (LLM-AHD) has shown strong potential in discovering effective heuristics for combinatorial optimization problems. However, existing methods primarily optimize a single heuristic, whereas practical optimization frameworks often rely on multiple interacting components...
Haoze Lv, Ning Lu, Shengcai Liu et al.· 0 citations
OptGraph is the first optimization agentic workflow that introduces graph retrieval-augmented generation (GraphRAG) and first constructs reusable experience as a typed graph, capturing the relationships among modeling patterns, problem formalization, implementation details, and error corrections.
Xianchao Xiu, Jianhao Li, Huangyue Chen et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.