Skip to content
Preprint

Instruction Quality Matters: Refining Instructions for Effective Preference Learning

Aug 2026 · 0 citations · 40 references
Computer Science

TL;DR

This work introduces an instruction-refinement pipeline that selects weak instructions using reward signals and revises them with rubric-guided LLM feedback, improving preference data without discarding examples, and indicates that instruction refinement raises achievable response quality and complements response-centric preference data curation.

Abstract

Preference learning optimizes models using response pairs, yet the informativeness of these pairs is fundamentally shaped by the instructions from which they are generated. We identify instruction quality as a hidden bottleneck in preference learning: low-quality or ambiguous instructions restrict the response-quality distribution, limiting strong chosen responses and weakening preference signals. Through Best- and Worst-of-N analyses, we show that instruction quality constrains both the ceiling and floor of sampled response quality. Motivated by this observation, we introduce an instruction-refinement pipeline that selects weak instructions using reward signals and revises them with rubric-guided LLM feedback, improving preference data without discarding examples. Across offline and online preference learning settings, experiments on multiple models and benchmarks show broad alignment improvements over original data and alternative data-improvement strategies. Further analyses indicate that instruction refinement raises achievable response quality and complements response-centric preference data curation. Overall, instruction quality emerges as a key factor governing how informative preference signals are formed for LLM alignment. Code is available at: https://github.com/01choco/instruction-refinement/

View source

Similar papers

Conference Open access Aug 2026

Cross-Relational Preference Learning for Better LLM Instruction Following

This work proposes Cross-Relational Preference Learning (CRPL), a novel framework for constructing preference data that explicitly models inter-instruction relationships through two key techniques: Cross-Relationship Perturbation and Cross-Region Pair Sampling, which enables the generation of more diverse preference da...

Run-Sheng Li, Kai Sun, Bin Shi et al. · 0 citations
#artificial intelligence Preprint Sep 2026

AlignDiff: Exploiting Model-Intrinsic Information for Better Preference Data Selection

AlignDiff, a preference data filtering framework driven by intrinsic model signals, first identifies samples with clear preferences using both positive and inverse signals, then prioritizes the more challenging samples based on the average negative log-likelihood gap, encouraging the model to learn richer information f...

Peng Lai, He Zhu, Zhiwen Ruan et al. · 1 citation
Preprint Aug 2026

Mitigating Exploration Bias in RL for Multi-Instruction Following

RL has emerged as a powerful paradigm for enhancing the instruction following capabilities of LLMs. While existing training recipes achieve substantial gains, we find that they suffer from exploration bias towards easy instructions when the training data has multiple instructions in a prompt. This bias is caused by two...

Mian Zhang, Yueqin Yin, Kaiyu He et al. · 0 citations
Preprint Aug 2026

LLMs as Acquisition Policies for Finite-Pool Materials Optimization: A Controlled Study

Overall, open-weight LLMs show potential as acquisition policies for finite-pool materials search, although their reliability remains sensitive to the task and to how candidates and scientific context are presented.

Dino-Rober Demir, Florian Le Bronnec, Rio Yokota · 0 citations
#artificial intelligence Preprint Sep 2026

Using Context Is Not Enough: Test-Time Training for Personalized Reward Modeling

Preference-Aligned Test-Time Training (P-TTT) is proposed, which explicitly encodes preference relations conveyed by contextual pairs into user-specific fast weights for personalized reward prediction and outperforms state-of-the-art methods by a large margin.

Bo-Hao Wang, Xiao-Yan Zhao, Yang Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.