arXiv Computation and Language

Constraint Tree Exploration for Learning from Language Feedback

The paper introduces TRACE, an algorithm that learns from natural‑language feedback by treating user intent as latent constraints and exploring feasible action regions organized in a tree. TRACE tests candidate constraints by generating compliant actions and only commits to a refinement when repeated feedback does not contradict it, offering two modes: falsification and identification. The authors provide theoretical coverage guarantees and demonstrate that TRACE‑Identification outperforms prompting baselines on six language‑feedback tasks, achieving higher success rates and robustness to identity corruption.

arXiv AI
Sep 11

TRACE: Training Reasoning Agents for Causal Exploration with Synthesized Rewards

The paper introduces TRACE, a digital‑advertising diagnostic environment that uses simulated interventions to generate verifiable rewards for training reasoning agents. By injecting controlled interventions into a simulator, the hidden cause of anomalies becomes an oracle label, enabling agents to learn to identify root causes and affected segments through noisy, confounded evidence. Experiments show that reinforcement learning with these synthesized rewards outperforms large prompted baselines, achieving higher accuracy while using fewer tool calls.

By Rui Sun, Zhan Shi, Bing He
arXiv AI
Sep 4

RECAST: Expanding the Boundaries of LLMs' Complex Instruction Following with Multi-Constraint Data

RECAST is a new framework that generates datasets with far more constraints per example than existing benchmarks, aiming to push large language models (LLMs) to better follow complex instructions. The authors built RECAST-30K, a 30,000‑instance dataset covering 19 constraint types extracted from real prompt‑response pairs, and showed that fine‑tuning on it improves LLMs’ ability to handle complex tasks without harming general performance. RECAST also provides rule‑based and LLM‑based validators for automatic constraint verification, enabling reward‑based reinforcement learning to further enhance model performance on challenging tasks.

By 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
arXiv AI
Oct 12

What Should SFT Learn? Conditional Information Gain for Generalizable Post-Training

The paper introduces CIG‑SFT, a supervised fine‑tuning method that uses conditional information gain to evaluate how much each demonstrated token reduces uncertainty about the task. By comparing token likelihoods from a frozen reference model with and without task input, the method derives a KL‑regularized projection of the current policy, yielding a scalar‑weighted SFT objective whose gradients match the projected target. Experiments on mathematical reasoning and code‑generation benchmarks show that CIG‑SFT outperforms standard SFT and adaptive fine‑tuning baselines, especially in generalizing to challenging evaluation distributions, without requiring extra data or online rollouts.

By Yuxuan Gu, Kequan Niu, Xiaocheng Feng, Yun Li, Yiqiao Yang, Bing Qin
arXiv Machine Learning
Oct 15

From Copying to Composition: How Language Models Develop In-Context Learning

The study investigates how language models acquire in-context learning (ICL) by distinguishing between copying a nearby demonstration and integrating information across a prompt. Across 17 models, roughly one-third default to copied answers, a few are undecided, and the remainder favor rule-consistent answers that yield higher accuracy and are guided by the requested value rather than the nearest conflicting example. Analyses show that models prioritize task-relevant prompt tokens before accuracy surpasses chance, and that synthetic or fine-tuned training can shift models toward compositional responses or improve accuracy when prompts reassign label meanings.

By Minglai Yang, Xinyu Guo, Renxiong Wang, Sunjie Hou, Daniel Yue Zhang, Yunzhong He
arXiv Computation and Language
18h ago

LIFT: Scoped Constraints for Evaluating and Training Instruction Following

LIFT introduces Lift-Bench, a new instruction‑following benchmark that asks language models to draft a document based on a topic and a structured outline, with constraints scoped to specific sections for finer control. The benchmark includes both verifiable and judged constraints and a training counterpart, Lift‑Train, designed to reduce reward hacking by providing both main‑task and instruction‑following constraints. Experiments show that state‑of‑the‑art models struggle with the harder subsets, and training on Lift‑Train is less prone to reward hacking than traditional IF training.

By Eran Goldstein, Yuval Belfer, Yonatan Belinkov, Daniel Gissin
arXiv Computation and Language
Sep 1

CAST: Critique-Aware Supervision for Training Reliable Long-Horizon Tool-Calling Agents

CAST is a critique‑aware training framework that transforms sparse task outcomes into action‑level supervision for both critique learning and policy optimization. By analyzing agent trajectories, CAST synthesizes structured rationales that explain action validity under partial observability, enabling the creation of richer training data. Fine‑tuned Qwen3‑family models trained with CAST show significant reliability gains, outperforming GPT‑OSS‑120B by over 10% on Retail tasks and improving Telehealth performance by 9% in an out‑of‑domain setting.

By Amir Saeidi, Zehua Zhang, Rishitosh Singh, Naman Ahuja, Vivek Gupta, Ali Payani, Gaowen Liu, Jayanth Srinivasa, Chitta Baral