AMoPO: Adaptive Multi-objective Preference Optimization without Reward Models and Reference Models

Existing multi-objective preference alignment methods for large language models (LLMs) face limitations: (1) the inability to effectively balance various preference dimensions, and (2) reliance on auxiliary reward/reference models introduces computational complexity.To address these challenges, we propose Adaptive Multi-objective Preference Optimization (AMoPO), a novel framework that achieves dynamic balance across preference dimensions.By introducing the multi-objective optimization paradigm to use the dimension-aware generation metrics as implicit rewards, AMoPO aligns LLMs with diverse preferences without additional reward models or reference models.We introduce an adaptive weight assignment mechanism that models the generation space as a Gaussian distribution, allowing dynamic prioritization of preference dimensions.Empirical results demonstrate that AMoPO outperforms state-of-the-art baselines by 28.5%, and the experiments on 7B, 14B, and 32B models reveal the scaling ability of AMoPO.Moreover, additional analysis of multiple dimensions verifies its adaptability and effectiveness.These findings validate AMoPO's capability to achieve dimension-aware preference alignment, highlighting its superiority.Our codes and datasets are available at https://github.com/Javkonline/AMoPO.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.462
Citations
1
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

AMoPO: Adaptive Multi-objective Preference Optimization without Reward Models and Reference Models

Zhi Zheng, D. Y. Wang, H. S. Zhao, Jingqing Ruan et al.
1 citations
Advanced Multi-Objective Optimization Algorithms
1.50
article

AMoPO: Adaptive Multi-objective Preference Optimization without Reward Models and Reference Models

Zhi Zheng, D. Y. Wang, H. S. Zhao, Jingqing Ruan, Jiansong Chen, Hao Li, Qi Liu, Xu Tong, Xunliang Cai, Wan Guanglu
article en
1 citations

Abstract

Existing multi-objective preference alignment methods for large language models (LLMs) face limitations: (1) the inability to effectively balance various preference dimensions, and (2) reliance on auxiliary reward/reference models introduces computational complexity.To address these challenges, we propose Adaptive Multi-objective Preference Optimization (AMoPO), a novel framework that achieves dynamic balance across preference dimensions.By introducing the multi-objective optimization paradigm to use the dimension-aware generation metrics as implicit rewards, AMoPO aligns LLMs with diverse preferences without additional reward models or reference models.We introduce an adaptive weight assignment mechanism that models the generation space as a Gaussian distribution, allowing dynamic prioritization of preference dimensions.Empirical results demonstrate that AMoPO outperforms state-of-the-art baselines by 28.5%, and the experiments on 7B, 14B, and 32B models reveal the scaling ability of AMoPO.Moreover, additional analysis of multiple dimensions verifies its adaptability and effectiveness.These findings validate AMoPO's capability to achieve dimension-aware preference alignment, highlighting its superiority.Our codes and datasets are available at https://github.com/Javkonline/AMoPO.

National Natural Science Foundation of China, National Science and Technology Major Project
Openalex Percentile: Top 14%
Advanced Multi-Objective Optimization Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.