Skip to content

Evolutionary Soups: Evolving Mixture-of-Experts for Multi-Objective LLM Alignment

Aug 2026 · 0 citations · 36 references
Computer Science

TL;DR

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.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts

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
#artificial intelligence Preprint Sep 2026

CoMerge: Conflict-Driven Preference Optimization for Multi-Task Model Merging

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
Book Open access Sep 2026

A Unified Generative Re-ranking Framework with Adaptive Multi-objective Fusion

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. · 0 citations
#machine learning Preprint Sep 2026

Rethinking Personalized Generation: Test-Time Alignment via Factorized Ranking Models

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.

Qi-Yao Ma, Jun-Shan Zhang, Zhe Zhao · 0 citations
#machine learning Preprint Oct 2026

Mixture-Trained Merging for Unified Multi-Objective 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 Aug 27, 2026

Looking beyond natural sequences

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.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.