about
Unsupervised Human Preference Learning (arxiv.org)
3 points by PaulHoule on Oct 24, 2024 | hide | past | pdf | discuss on HN

In plain words: A small local model studies a person's own emails and articles, then writes plain-language rules that tell a big model how to write for them, without retraining the big one. It beat the usual tricks, like showing examples or lightly tuning the big model.

Abstract

Large language models demonstrate impressive reasoning abilities but struggle to provide personalized content due to their lack of individual user preference information. Existing methods, such as in-context learning and parameter-efficient fine-tuning, fall short in capturing the complexity of human preferences, especially given the small, personal datasets individuals possess. In this paper, we propose a novel approach utilizing small parameter models as preference agents to generate natural language rules that guide a larger, pre-trained model, enabling efficient personalization. Our method involves a small, local "steering wheel" model that directs the outputs of a much larger foundation model, producing content tailored to an individual's preferences while leveraging the extensive knowledge and capabilities of the large model. Importantly, this personalization is achieved without the need to fine-tune the large model. Experimental results on email and article datasets, demonstrate that our technique significantly outperforms baseline personalization methods. By allowing foundation models to adapt to individual preferences in a data and compute-efficient manner, our approach paves the way for highly personalized language model applications.

Sumuk Shashidhar, Abhinav Chinta, Vaibhav Sahai, Dilek Hakkani-Tür
arXiv:2410.03731 · cs.CL, cs.AI · submitted Sep 30, 2024 · updated Oct 11, 2024
abstract · pdf · html · EMNLP 2024 Main Conference

add comment on HN