Papers for

automated decision system engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Tracing language model interventions in reinforcement learning for games

LocusRL: Diagnosing LLM Reward and Policy Interventions in Competitive Games

Abstract: Large language models can intervene in reinforcement learning through both reward design and action selection, yet aggregate performance offers an incomplete account of what these interventions actually do. Similar returns can conceal different learning mechanisms, while plausible rewards can induce undesirable behavior. We introduce LocusRL, a diagnostic framework that connects controlled reward-policy comparisons with audits of reward judgments, signal delivery, optimization objectives, and executed actions. The framework traces performance differences to testable explanations and checks targeted corrections through executable rules and counterfactual replay. Across two evaluation batches covering ten Connect Four training seeds, we uncover seed-dependent reversals in intervention effects and show how tracing actual updates changes their interpretation: historical Qwen training operates through reward-weighted teacher-action likelihood. A separate matched three-seed reward-direction experiment distinguishes sensitivity to a learning signal from its usefulness. With terminal rewards held fixed, a sign-reversed dense oracle yields a 2.8% aggregate win rate, compared with 57.2% for terminal-only training and 46.7% for the positive dense oracle. Thus, a reward can strongly influence learning without improving performance. At the decision level, counterfactual replay verifies a winning correction to a diagnosed action error. Complementary experiments in Leduc and reward-validation studies in Goofspiel extend the analysis to imperfect-information settings, revealing how reference-label definitions and validation-data exposure affect intervention assessment. Together, these findings show why evaluating LLM interventions requires tracing how their outputs become learning signals and actions. LocusRL turns aggregate outcomes into actionable diagnoses and verifiable corrections.

Sat 3 OctMachine Learning
The gist
Training AI to play games often involves teaching through rewards and actions, but just looking at overall success can miss how the AI is really learning. The authors created LocusRL, a method to carefully track how rewards and actions affect learning inside AI models for games like Connect Four. They found that different training tricks can lead to similar results in unexpected ways, and that changing rewards doesn’t always improve performance. Their method also lets them diagnose and fix mistakes the AI makes during decision-making.
Open → 2610.04441v1

Rc-opd improves reasoning in ai by fixing root errors early

Learning from Repaired Reasoning: Root-Cause-Guided On-Policy Distillation

Abstract: On-policy self-distillation (OPSD) uses reference solutions as privileged hindsight to supervise student-generated reasoning trajectories. However, reference-based guidance may explain a correct solution without addressing why the student's own reasoning fails. This reasoning mismatch between the guidance provided and the correction needed can encourage the student to borrow correct conclusions while leaving its reasoning errors unresolved. Moreover, applying the same hindsight throughout the trajectory risks a distillation trap, where unnecessary constraints on valid reasoning compete with correction of substantive errors. To address these issues, we propose Root-Cause-Guided On-Policy Distillation (RC-OPD), which uses repairs of the student's own reasoning to provide guidance that addresses its specific errors while building on valid progress. For each failed attempt, RC-OPD locates the earliest substantive error, develops a local correction, and uses the corrected intermediate result as an anchor for the valid prefix. An iterative diagnosis--repair--continuation process tests the repairs through student continuation, identifying further errors within a fixed repair budget. For repair chains that reach a correct answer, root--cause--guided distillation uses failure diagnoses and corrective goals to supervise the erroneous segments, while anchor-guided distillation supports the corresponding valid prefixes with reasoning chains leading to the repaired intermediate results. We evaluate RC-OPD across multiple datasets and model scales. Extensive experiments and analyses show that it mitigates reasoning mismatch and the distillation trap, yielding substantial performance gains.

Fri 2 OctComputation and Language
The gist
When AI systems solve problems step by step, they sometimes make mistakes but don’t learn why those mistakes happened. The authors propose a method called Root-Cause-Guided On-Policy Distillation (RC-OPD) that finds the earliest error in the AI’s steps and helps fix it before moving forward. This approach guides the AI more precisely, improving its reasoning accuracy over time. Experiments showed that this method helps AI models perform better by fixing specific errors instead of just copying correct answers.
Open → 2610.03515v1

Deep research agents avoid premature conclusions with rollback control

DeepRewind: Predicting and Repairing Premature Commitments in Deep Research Agents

Abstract: Deep-research agents conduct long-horizon investigations through iterative search, evidence evaluation, belief revision, and synthesis. However, they may commit to claims before sufficient evidence is available, causing later reasoning to reinforce an incorrect interpretation. We introduce DeepRewind, an additive control layer for reversible deep research that represents the agent's evolving epistemic state as a typed graph of sources, evidence, claims, hypotheses, assumptions, commitments, plans, and drafts. Before accepting an intermediate conclusion, a prompt-based world model predicts its impact and estimates reversibility based on hypothesis narrowing, information loss, recovery cost, and contradiction-trigger coverage. A binary controller blocks risky commitments, while a consistency monitor performs dependency-aware rollback when later evidence invalidates them. Across DRBench and LiveDRBench, DeepRewind improves insight recall by 3.6 percentage points and reduces premature commitments by 59.1% relative to Open Deep Research.

Mon 28 SeptComputation and Language
The gist
Sometimes, AI systems exploring complex problems decide they’ve found an answer too soon, which can lead to mistakes. The authors designed DeepRewind, an extra layer that helps these systems track all their evidence and ideas clearly. Before accepting conclusions, it predicts if they might lead to problems later and blocks risky jumps. If new information later shows a conclusion was wrong, DeepRewind can undo decisions and fix the reasoning. This approach makes AI research agents more careful and accurate.
Open → 2609.36344v1

Model based bootstrap improves uncertainty estimates for offline policy evaluation

Model-based Bootstrap for Offline Policy Evaluation in Tabular Reinforcement Learning

Abstract: Offline policy evaluation (OPE) is crucial in high-stakes reinforcement learning applications, where new policies must be assessed reliably before deployment. In such settings, point estimates alone are insufficient; principled uncertainty quantification, such as confidence intervals and variance estimates, is essential for safe and risk-aware decision-making. A comprehensive way to unify these tasks is to estimate the sampling distribution of the evaluation error. Existing approaches, however, often suffer from limited robustness, scalability, or finite-sample validity. In this paper, we propose a model-based bootstrap framework for uncertainty quantification of OPE in finite-horizon, time-inhomogeneous Markov decision processes (MDPs). Unlike classical bootstrap methods that rely on resampling complete episodes, the proposed method regenerates trajectories from an estimated MDP and can therefore accommodate a much broader range of offline data formats, including complete trajectories, transition-level observations, and trajectory fragments. This flexibility further improves finite-sample statistical efficiency. We establish bootstrap distributional consistency, asymptotically valid confidence intervals, and consistent variance estimation for the target policy value. Extensive simulations show that the proposed method accurately captures the sampling distribution of the OPE estimator, yielding tighter confidence intervals and more accurate variance estimates in most settings.

Thu 17 SeptMachine Learning
The gist
Deciding if a new way for a computer to make decisions works well without testing it live is very important, especially when mistakes are costly. The authors introduce a new method that creates many fake examples based on a learned model to better understand how certain we can be about the computer's predicted performance. This method works well with different types of offline data and gives more reliable confidence measures than older approaches. It helps people know not just the expected result but also how much the result might vary, making decision-making safer.
Open → 2609.20389v1