Jointly Reinforcing Diversity and Quality in Language Model Generations
Tianjian Li, Yiming Zhang, Ping Yu, Swarnadeep Saha, Daniel Khashabi, Jason Weston, Jack Lanchantin, Tianlu Wang
TL;DR
DARLING tackles diversity collapse in post-trained LMs by introducing a semantic-diversity signal learned via a classifier and integrating it multiplicatively with a quality reward in online reinforcement learning. By partitioning responses into semantic equivalence classes and computing a Div_d signal, it achieves r_darling = r ⋅ Norm(Div_d) and optimizes a GRPO-based objective, with token-level updates and no standard-deviation normalization. The approach generalizes to non-verifiable tasks (instruction following, creative writing) and verifiable tasks (competition math), delivering simultaneous gains in quality and diversity, and it promotes exploration that improves overall performance. Across multiple model families and sizes, Darling outperforms quality-only baselines and lexical-diversity baselines, demonstrating significant improvements in pass@1 and pass@k and stronger creativity metrics, with ablations confirming the benefits of semantic diversity and multiplicative fusion.
Abstract
Post-training of Large Language Models (LMs) often prioritizes accuracy and helpfulness at the expense of diversity. This creates a tension: while post-training improves response quality, it also sharpens output distributions and reduces the range of ideas, limiting the usefulness of LMs in creative and exploratory tasks such as brainstorming, storytelling, or problem solving. We address this challenge with Diversity-Aware Reinforcement Learning (DARLING), a framework that jointly optimizes for response quality and semantic diversity. At its core, DARLING introduces a learned partition function to measure diversity beyond surface-level lexical variations. This diversity signal is then combined with a quality reward during online reinforcement learning, encouraging models to generate outputs that are both high-quality and distinct. Experiments across multiple model families and sizes show that DARLING generalizes to two regimes: non-verifiable tasks (instruction following and creative writing) and verifiable tasks (competition math). On five benchmarks in the first setting, DARLING consistently outperforms quality-only RL baselines, producing outputs that are simultaneously of higher quality and novelty. In the second setting, DARLING achieves higher pass@1 (solution quality) and pass@k (solution variety). Most strikingly, explicitly optimizing for diversity catalyzes exploration in online RL, which manifests itself as higher-quality responses.
