mlsanityData to 7 Oct 2026

When Do Surrogate Updates Improve Decisions? A Local Theory of Trajectory-Wise Transfer

arXiv 2608.01130 ↗First posted 2 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

A broad range of models face the mismatch where they are updated through trajectory losses but are evaluated by downstream task reward. Here, a trajectory is a training instance that induces a surrogate loss whose reduction might not track the model's decision utility update. Theoretically, we ask when one step of trajectory training reduces both population surrogate loss and decision risk, and how transfer accumulates along repeated updates. To formalize this, we first fix a checkpoint and a restricted update space, and define the reductions in population surrogate risk and decision risk induced by a trajectory as its learnability and decision utility, respectively. On this basis, our theory yields four main results. First, a one-step transfer bound separates their discrepancy into first-order gradient misalignment after nonnegative calibration and second-order curvature; and a pathwise extension accumulates the same terms over repeated updates. Second, when the accessible surrogate gradient is nonzero, universal first-order transfer over every accessible direction holds exactly when the accessible surrogate and decision gradients are positively collinear. Third, the calibration gap bounds the decision regret of learnability-based trajectory selection, while a candidate-difference refinement tightens this guarantee by retaining only directions that affect pairwise rankings. Finally, we establish an approximation--calibration trade-off across nested update spaces. Controlled gridworld and LLM post-training experiments yield results consistent with our predictions.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 29 references that are in the map. First posted on arXiv 2 Aug 2026.

Builds on

15 of 29 references.

References · 15

  1. 2022Training language models to follow instructions with human feedbackcited by 15,712
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  4. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  5. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 642
  6. 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 514
  7. 2017Smart "Predict, then Optimize"cited by 332
  8. 2023Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Taskscited by 320
  9. 2022Teaching Small Language Models to Reasoncited by 279
  10. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  11. 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
  12. 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
3 more
  1. 2021Risk Bounds and Calibration for a Smart Predict-then-Optimize Methodcited by 28
  2. 2017On Structured Prediction Theory with Calibrated Convex Surrogate Lossescited by 23
  3. 2024Decision-Focused Learning with Directional Gradientscited by 16

Built on by

Not cited yet.