Pith. sign in

REVIEW 27 cited by

Jointly Reinforcing Diversity and Quality in Language Model Generations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2509.02534 v1 pith:6HJLP3I4 submitted 2025-09-02 cs.CL cs.LG

Jointly Reinforcing Diversity and Quality in Language Model Generations

classification cs.CL cs.LG
keywords diversityqualitydarlingtaskscreativehigherjointlylanguage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 27 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. OrderGrad: Optimizing Beyond the Mean with Order-Statistic Policy Gradient Estimation

    cs.LG 2026-06 unverdicted novelty 7.0

    OrderGrad supplies unbiased likelihood-ratio and reparameterization gradient estimators for finite-sample L-statistics by applying a rank-based reward transformation usable in standard policy-gradient updates.

  2. Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning

    cs.CL 2026-05 unverdicted novelty 7.0

    CPPO coordinates K=4 distinct strategy tuples via planner and solver with multiplicative reward, improving pass@4 over baselines on APPS, CodeContests, and LiveCodeBench.

  3. Weak-to-Strong Elicitation via Mismatched Wrong Drafts

    cs.CL 2026-05 conditional novelty 7.0

    Mismatched wrong drafts from a 1.5B math model injected into GRPO training of a 7B model yield higher pass rates on MATH-500 and AIME than on-policy baselines or matched variants.

  4. Weak-to-Strong Elicitation via Mismatched Wrong Drafts

    cs.CL 2026-05 unverdicted novelty 7.0

    Mismatched wrong drafts from Qwen2.5-Math-1.5B improve Mathstral-7B GRPO training, reaching 71.98% greedy pass@1 on MATH-500 and lifting AIME 2025/2026 pass@k over baselines and other draft variants.

  5. Breaking $\textit{Winner-Takes-All}$: Cooperative Policy Optimization Improves Diverse LLM Reasoning

    cs.AI 2026-05 unverdicted novelty 7.0

    GCPO shifts RLVR from rollout competition to team cooperation by assigning advantages via marginal contributions to a determinant-based coverage volume over semantic embeddings, yielding higher accuracy and solution d...

  6. Breaking $\textit{Winner-Takes-All}$: Cooperative Policy Optimization Improves Diverse LLM Reasoning

    cs.AI 2026-05 unverdicted novelty 7.0

    GCPO uses team-level credit assignment via determinant volume over reward-weighted semantic embeddings to promote non-redundant correct reasoning paths, improving both accuracy and diversity in LLM training.

  7. Ex Ante Evaluation of AI-Induced Idea Diversity Collapse

    cs.AI 2026-05 unverdicted novelty 7.0

    Frontier LLMs generate creative ideas with excess population-level crowding below human-relative parity across tasks, but targeted generation protocols can reduce it.

  8. Task-Dependent Evaluation of LLM Output Homogenization: A Taxonomy-Guided Framework

    cs.CL 2025-09 conditional novelty 7.0

    Proposes a task taxonomy for functional diversity in LLM outputs, validates it via user study, introduces targeted sampling to boost diversity only where needed, and presents evidence that the diversity-quality tradeo...

  9. Cast a Wider Net: Coordinated Pass@K Policy Optimization for Code Reasoning

    cs.CL 2026-05 conditional novelty 6.5

    Coordinated Pass@K Policy Optimization improves code pass@4 by jointly training a strategy-tuple planner and solver with a validity-gated outcome reward.

  10. The One-Word Census: Answer-Choice Conformity Across 44 Language Models

    cs.CL 2026-07 conditional novelty 6.0

    Forty-four language models asked to name one thing per category converge on the same modal answers far more than people do, with newest flagships most conformist and persona-tuned models most divergent.

  11. The One-Word Census: Answer-Choice Conformity Across 44 Language Models

    cs.CL 2026-07 conditional novelty 6.0

    Across 31 open one-word categories, 44 LMs converge extremely (often >80% on one answer), with newest flagships most conformist and persona-tuned models most divergent.

  12. Decomposer: Learning to Decompile Symbolic Music to Programs

    cs.LG 2026-07 unverdicted novelty 6.0

    Decomposer fine-tunes on synthetic Strudel-MIDI pairs then applies RL on unpaired MIDI to produce faithful yet readable music programs, outperforming LLMs and heuristics on reconstruction and readability.

  13. On-Policy Self-Distillation with Sampled Demonstrations Reduces Output Diversity

    cs.LG 2026-06 unverdicted novelty 6.0

    On-policy self-distillation with sampled demonstrations reduces rollout diversity by amplifying existing probability gaps in the base model, unlike ideal RL which preserves ratios among correct outputs.

  14. On Advantage Estimates for Max@K Policy Gradients

    cs.LG 2026-06 unverdicted novelty 6.0

    Proposes MaxPO using a Leave-Two-Out baseline for centered unbiased advantages in max@K policy gradients, with a unified derivation of finite-batch estimators.

  15. Using Reward Uncertainty to Induce Diverse Behaviour in Reinforcement Learning

    cs.LG 2026-06 unverdicted novelty 6.0

    Replaces scalar reward with a distribution over reward functions and applies a non-linear objective over action sets to induce controllable diversity in contextual bandit RL, generalizing policy gradient methods.

  16. DEI: Diversity in Evolutionary Inference for Quality-Diversity Search

    cs.LG 2026-05 unverdicted novelty 6.0

    DEI shows a heterogeneous four-LLM ensemble achieving 124% higher QD-Score and 28% higher coverage than single-model baselines on Core War at equal compute budget.

  17. Too Correct to Learn: Reinforcement Learning on Saturated Reasoning Data

    cs.LG 2026-04 unverdicted novelty 6.0

    A parameter-free sampling strategy called CUTS combined with Mixed-CUTS training prevents mode collapse in RL for saturated LLM reasoning tasks and raises AIME25 Pass@1 accuracy by up to 15.1% over standard GRPO.

  18. Vocabulary Dropout for Curriculum Diversity in LLM Co-Evolution

    cs.CL 2026-04 unverdicted novelty 6.0

    Vocabulary dropout prevents diversity collapse in LLM co-evolution by masking proposer logits, yielding average +4.4 point solver gains on mathematical reasoning benchmarks at 8B scale.

  19. VOYAGER: A Training Free Approach for Generating Diverse Datasets using LLMs

    cs.CL 2025-12 unverdicted novelty 6.0

    Voyager iteratively optimizes a determinantal point process diversity measure to generate synthetic LLM datasets, delivering 1.5-3 times higher diversity than baselines in experiments.

  20. Representation-Based Exploration for Language Models: From Test-Time to Post-Training

    cs.LG 2025-10 conditional novelty 6.0

    Representation-based elliptical bonuses improve inference-time and post-training pass@k for LLM reasoning, but the headline AIME result is tainted by validation/test overlap.

  21. Outcome-based Exploration for LLM Reasoning

    cs.LG 2025-09 conditional novelty 6.0

    Outcome-based exploration bonuses (UCB-Con and Batch) improve pass@1 and pass@32 for LLM math reasoning while slowing diversity collapse, supported by a bandit model with a strong generalization assumption.

  22. Reasoning or Memorization? Direction-Aware Diversity Exploration in LLM Reinforcement Learning

    cs.AI 2026-06 unverdicted novelty 5.0

    DiRL extracts a reasoning-memorization direction from model representations inside GRPO to weight gradients and shape rewards so that exploration favors reasoning trajectories over memorization ones.

  23. Teacher-Free Self-Training Amplifies but Does Not Compound: A Pass@$K$ Crossover on a Free-Verifier Domain

    cs.LG 2026-06 unverdicted novelty 5.0

    Self-training on verified outputs in a free-verifier DSL amplifies performance at pass@8 but does not expand reach, as the base model overtakes at pass@64 across trajectories.

  24. Vocabulary Dropout for Curriculum Diversity in LLM Co-Evolution

    cs.CL 2026-04 conditional novelty 5.0

    Randomly masking a proposer's output vocabulary during training and generation sustains curriculum diversity and improves solver accuracy by +4.4 points at 8B in LLM co-evolution.

  25. Optimizing Diversity and Quality through Base-Aligned Model Collaboration

    cs.CL 2025-11 conditional novelty 5.0

    At every token, a router switches between a base LLM and its aligned counterpart based on uncertainty and word type, improving the diversity-quality trade-off across open-ended generation tasks.

  26. Polychromic Objectives for Reinforcement Learning

    cs.LG 2025-09 unverdicted novelty 5.0

    Introduces polychromic objectives adapted into PPO via vine sampling and modified advantages, showing higher success rates and better coverage under perturbations on BabyAI, Minigrid, and algorithmic tasks.

  27. A Survey of Reinforcement Learning for Large Reasoning Models

    cs.CL 2025-09 accept novelty 3.0

    A survey compiling RL methods, challenges, data resources, and applications for enhancing reasoning in large language models and large reasoning models since DeepSeek-R1.