Adaptive Helpfulness-Harmlessness Alignment with Preference Vectors

Ren-Wei Liang, Chin-Ting Hsu, Chan-Hung Yu, Saransh Agrawal, Shih-Cheng Huang +4 more
4/27/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Ensuring that large language models (LLMs) are both helpful and harmless is a critical challenge, as overly strict constraints can lead to excessive refusals, while permissive models risk generating harmful content. Existing approaches, such as reinforcement learning from human feedback (RLHF) and direct preference optimization (DPO), attempt to balance these trade-offs but suffer from performance conflicts, limited controllability, and poor extendability. To address these issues, we propose Preference Vector, a novel framework inspired by task arithmetic. Instead of optimizing multiple preferences within a single objective, we train separate models on individual preferences, extract behavior shifts as preference vectors, and dynamically merge them at test time. This modular approach enables fine-grained, user-controllable preference adjustments and facilitates seamless integration of new preferences without retraining. Experiments show that our proposed Preference Vector framework improves helpfulness without excessive conservatism, allows smooth control over preference trade-offs, and supports scalable multi-preference alignment.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{liang2025adaptive,
  title  = {Adaptive Helpfulness-Harmlessness Alignment with Preference Vectors},
  author = {Ren-Wei Liang and Chin-Ting Hsu and Chan-Hung Yu and Saransh Agrawal and Shih-Cheng Huang and Chieh-Yen Lin and Shang-Tse Chen and Kuan-Hao Huang and Shao-Hua Sun},
  year   = {2025},
  eprint = {2504.20106},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.20106v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.20106.svg)](https://codeofpaper.com/paper/2504.20106)

Discussion