Evolutionary Soups, a mixture-of-experts framework for fine-grained generation control, with gating networks trained via an evolutionary algorithm, achieves the best hypervolume, linear utility, and Tchebyshev utility among controllable methods on all tasks.
Abstract
Large language models are increasingly required to generate responses that satisfy multiple competing objectives. Since optimal trade-offs depend on both user preferences and input prompts, controllable multi-objective generation must dynamically adapt models at inference time without retraining. To address this, we propose Evolutionary Soups, a mixture-of-experts framework for fine-grained generation control, with gating networks trained via an evolutionary algorithm. The per-layer gating networks dynamically produce expert-merging coefficients from hidden-state representations, while the evolutionary algorithm incorporates greedy hypervolume contribution for effective evolution of these gating networks, achieving consistent improvements on large and noisy training datasets and broader coverage of the non-convex Pareto front. Experiments across three tasks demonstrate the effectiveness of Evolutionary Soups over baselines: it achieves the best hypervolume, linear utility, and Tchebyshev utility (~20% improvement) among controllable methods on all tasks.
Experiments show that DIAG boosts yield across iterations and delivers stronger reasoning performance under an iso-effective training budget, demonstrating that it can distill more informative preference supervision for mathematical reasoning.
Gu-Han Chen, Songtao Tian, Bo-Han Li et al.· 0 citations
Layer-wise Distribution Alignment (LDA), a lightweight inference-time correction that uses layer-wise calibration statistics to align reduced-routing representations with the default configuration, is proposed, recovering much of the performance lost induced by the distributional shift under reduced routing while prese...
Dohyeon Kim, Bedionita Soro, Sung Ju Hwang· 0 citations
A conflict-driven preference optimization framework for model merging (CoMerge), which reformulates model merging as a preference optimization problem and utilizes a self-supervised, conflict-driven strategy that leverages the defects of naive merging methods as hard negative samples to construct preference pairs witho...
Ming-Jie Zheng, Zi-Hao Chen, Wen-Qing Chen et al.· 0 citations
In e-commerce recommendation, effective re-ranking must jointly optimize multiple business objectives such as clicks, add-to-carts, and purchases. Existing methods typically employ either multiple per-objective generators combined with static fusion through handcrafted rules, or adopt non-autoregressive sequence genera...
Heng-Rui Zhang, Yi-Fan Gu, Wei Xu et al.· Proceedings of the 20th ACM...· 0 citations
This work uses empirical studies to reveal the existence of a massive, untapped performance headroom for personalized generation through test-time alignment, and proposes a parameter-efficient framework utilizing million-parameter scale multi-layer perceptron (MLP) ranking models.
Unified language models are increasingly expected to combine heterogeneous capabilities, such as mathematics, code, instruction following, and controllable thinking behavior, within a single set of parameters. A common solution is sequential post-training on multiple objectives, but this entangles all objectives along...
Seonghyeon Kim, Chaeyun Jang, Seungyoo Lee et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.