Offline RL by Reward-Weighted Fine-Tuning for Conversation Optimization
This addresses the problem of optimizing conversation policies in offline RL for AI researchers, offering a simpler approach compared to state-of-the-art methods.
The paper tackles offline reinforcement learning for large language models by proposing reward-weighted fine-tuning as a practical alternative to existing methods, reporting major gains in optimized rewards and language quality.
Offline reinforcement learning (RL) is a variant of RL where the policy is learned from a previously collected dataset of trajectories and rewards. In our work, we propose a practical approach to offline RL with large language models (LLMs). We recast the problem as reward-weighted fine-tuning, which can be solved using similar techniques to supervised fine-tuning (SFT). To showcase the value of our approach, we apply it to learning short-horizon question-answering policies of a fixed length, where the agent reasons about potential answers or asks clarifying questions. Our work stands in a stark contrast to state-of-the-art methods in this domain, based on SFT and direct preference optimization, which have additional hyper-parameters and do not directly optimize for rewards. We compare to them empirically, and report major gains in both optimized rewards and language quality.