cs.LGMay 28, 2026

LARK: Learnability-Grounded Trajectory Selection for Efficient Reasoning Distillation

Authors: Tianrun YuKaixiang ZhaoChih-Chun ChenAmanda HughesTaylor W. KillianFenglong MaWeitong ZhangPorter Jenkins

Organizations: Brigham Young University · The Pennsylvania State University · University of North Carolina at Chapel Hill

Abstract

We study trajectory selection for reasoning distillation, where teacher-generated reasoning trajectories are selectively used as supervision for a student model. Existing methods rely on heuristics such as trajectory quality or model confidence, but they often overlook whether a trajectory is learnable by the student. In this paper, we present LARK, a learnability-grounded method for reasoning trajectory selection. LARK selects trajectories that the student can learn efficiently while preserving the generalization of the full training distribution. At the core of LARK is a learnability factor ρρ, which characterizes the rate at which the student's training loss decreases. To estimate this rate efficiently and maintain generalization, we introduce a learnability proxy and a χ2χ^2-regularized selection policy that balances learnability and distributional coverage, both with strong theoretical guarantees on their estimation error. Empirically, LARK consistently outperforms data selection baselines across multiple base models and reasoning tasks. Diagnostic analyses show that the LARK score predicts downstream training utility and that LARK-selected trajectories induce faster supervised fine-tuning loss reduction. Our code is available at https://github.com/Tianrun-Yu/LARK.

Explore similar work

CardsList