Preference-Aware Mixture-of-Experts for Multi-Objective Combinatorial Optimization
Its authors withdrew this paper, so there is no full text to read or summarize.
Lists
Only you see this
Abstract
Recent neural methods for multi-objective combinatorial optimization involve solving preference-specific subproblems with a single model and have achieved competitive performance. However, they still suffer from limited learning efficiency and insufficient exploration of the solution space. This paper conducts a theoretical analysis that reveals the equivalence between this single-model paradigm and an implicit Mixture-of-Experts architecture. Furthermore, we propose a Preference-Aware mixture-of-experts (PA-MoE) framework that learns preference-specific representations while explicitly modeling preference-instance interactions. By integrating a sparsely activated expert module with an innovative preference-aware gating mechanism, PA-MoE enhances preference-conditioned representation learning while preserving parameter efficiency. Moreover, PA-MoE is generic and can be applied to three different neural MOCO solvers. Experimental results on the multi-objective traveling salesman problem (MOTSP), multi-objective capacitated vehicle routing problem (MOCVRP), and multi-objective knapsack problem (MOKP) show that PA-MoE is able to generate a Pareto front with higher diversity, achieving superior overall performance.
BibTeX
@misc{liu2026preference,
author = {Wei Liu and Yaoxin Wu and Yingqian Zhang and Thomas Bäck and Yingjie Fan},
title = {{Preference-Aware Mixture-of-Experts for Multi-Objective Combinatorial Optimization}},
year = {2026},
url = {https://openreview.net/forum?id=lVcGqdQ8N7},
howpublished = {OpenReview},
note = {Submitted to ICLR 2026},
}Loading related content...