arXiv AI

Towards Efficient Pareto Set Approximation via Mixture of Experts Based Model Fusion

arXiv:2406. 09770v2 Announce Type: replace-cross Abstract: Solving multi-objective optimization problems for large deep neural networks is a challenging task due to the complexity of the loss landscape and the expensive computational cost of training and evaluating models.

arXiv AI
Oct 16

In-Context Preference-Conditioned Pareto Set Learning from Limited Offline Data

The paper introduces In-Context Preference-Conditioned Pareto Set Learning (ICPSL), a framework that uses a pretrained hypernetwork to generate a problem-specific, preference-conditioned Pareto solution model from limited offline data. ICPSL eliminates the need for repeated preference-wise searches or problem-specific training by producing a reusable model in a single forward pass. Experiments on synthetic and real-world problems demonstrate that ICPSL yields high-quality Pareto solutions while significantly speeding up model construction.

By Yiming Yao, Liang Zhao, Qingfu Zhang
arXiv Machine Learning
Jun 19

Interactive Pareto navigation for deep multi-task learning

arXiv:2606. 19521v1 Announce Type: new Abstract: In multi-task learning, handling an increasing number of objectives can quickly become challenging, both in terms of the computational resources and the decision maker's capacity to choose appropriate trade-offs.

By Augustina C. Amakor, Konstantin Sonntag, Sebastian Peitz
arXiv Machine Learning
Oct 15

Spectral-MoE: Heterogeneous Per-Layer Expert Utilization in Dense-to-MoE Conversion

Spectral-MoE introduces a method for allocating heterogeneous per-layer expert utilization in dense-to-mixture-of-experts (MoE) conversion of large language models. It offers both static and dynamic allocators that learn to distribute a utilization budget across layers, improving performance over uniform allocation in both analytic- and learning-based conversion baselines. Experiments on Llama-2-7B, Llama-3-8B, and Qwen2.5-7B show significant reductions in perplexity and accuracy gains at various FFN utilizations.

By Zachary Broveak, Christian Kubicka, Thierry Tambe
arXiv Machine Learning
Oct 3

MoRA: MoE Pruning via Router Bias Learning and Expert Approximation

MoRA is a framework for pruning Mixture-of-Experts (MoE) models by learning a router bias for each expert and optimizing it with a language‑modeling loss and a routing‑diversity regularizer. The learned biases sharpen routing distributions to identify critical experts and encourage diverse routing preferences. After pruning, MoRA uses an expert approximation mechanism that approximates the outputs of pruned experts with affine transformations of remaining experts, further improving performance.

By Yushuai Sun, Zikun Zhou, Lin Gao, Jun Yu, Wenjie Pei
arXiv AI
Oct 16

RecSoup: Efficient Model Merging Approach for Controllable Multi-Objective Recommendation

RecSoup introduces a lightweight two‑stage method for Controllable Multi‑Objective Recommendation (CMOR) that merges multiple objective‑specific models without retraining. The approach first prunes parameters to reduce cross‑objective interference, then adaptively merges them using a learnable preference‑to‑coefficient mapping, enabling dynamic trade‑off control at inference time. Experiments show RecSoup achieves superior Pareto front quality and 165–228× faster inference than parameter‑generation baselines.

By Zidong Jia, Guofu Xie, Xiao Zhang