RECAST: Expanding the Boundaries of LLMs' Complex Instruction Following with Multi-Constraint Data
Zhengkang Guo, Wenhao Liu, Mingchen Xie, Jingwen Xu, Zisu Huang, Muzhao Tian, Jianhan Xu, Yuanzhe Shen, Qi Qian, Muling Wu, Xiaohua Wang, Changze Lv, He-Da Wang, Hu Yao, Xiaoqing Zheng, Xuanjing Huang
TL;DR
This work targets the bottleneck of complex instruction following by LLMs. It introduces RECAST, a scalable pipeline that mines both rule-based and model-based constraints from real responses to produce RECAST-30K, a dense dataset with up to 19 constraint types across roughly 29,939 examples. By enabling automatic constraint verification via rule-based and LLM validators, RECAST supports per-constraint rewards and reinforcement learning. The authors propose RLVC, which uses GRPO to optimize multi-constraint satisfaction while preserving general capabilities, achieving strong performance on RECAST-Test, out-of-domain benchmarks, and general capability evaluations. Overall, RECAST provides verifiable supervision and scalable resources to push the practical reliability and controllability of instruction-following in LLMs.
Abstract
Large language models (LLMs) are increasingly expected to tackle complex tasks, driven by their expanding applications and users' growing proficiency in crafting sophisticated prompts. However, as the number of explicitly stated requirements increases (particularly more than 10 constraints), LLMs often struggle to accurately follow such complex instructions, which limits their applicability in complex real-world scenarios. To the best of our knowledge, existing datasets do not exceed 10 constraints per instance. To address this challenge, we propose RECAST, an efficient and scalable framework for synthesizing datasets where each example incorporates far more constraints than those in existing benchmarks, aiming to challenge and extend the boundaries of models' ability to follow complex instructions. These constraints are extracted from real-world prompt-response pairs to ensure practical relevance. Using this framework, we construct RECAST-30K, a large-scale, high-quality dataset comprising 30k instances spanning 19 constraint types. Experimental results demonstrate that models finetuned on RECAST-30K substantially improve in following complex instructions while maintaining their general capabilities without degradation. Moreover, RECAST enables automatic verification of constraint satisfaction via rule-based validators for quantitative constraints and LLM-based validators for qualitative ones; the verifiability provided by RECAST enables the design of reward functions for reinforcement learning, which further boosts model performance on complex and challenging tasks.
