paper-with-me

홈 › Papers

Epistemic Regret Minimization: Label-Free Causal Critique Beyond Outcome Reward

2026-02-12 · Edward Y. Chang, Longling Geng arxiv

Large language models can answer causal questions correctly for the wrong reasons. Current RL methods reward \emph{what} a model concludes but ignore \emph{why}, reinforcing correlational shortcuts -- a failure we call \emph{Reward Entrenchment}. We introduce \emph{Epistemic Regret Minimization} (\erm), a framework that critiques the causal \emph{structure} of a model's reasoning trace rather than its answer. Applying established causal principles, \erm flags unexamined confounders, correlation--intervention conflation, and unchecked back-door paths from exposed reasoning traces. The framework admits \emph{label-free} operation -- without the true causal graph or correct answer -- and we separately distinguish favorable benchmark-derived critique, error-direction cues, and fully label-free judge-generated critique in the experiments. Within a single episode, \erm detects and repairs causal reasoning errors; across episodes, it accumulates interventional evidence into a reward signal applicable where no answer key exists. Experiments on 1,360 scenarios across six frontier LLMs show that reasoning-heavy models (GPT-4 Turbo, GPT-5.2) resist outcome-only correction (25--31\% recovery) yet respond to causal critique (78--91\%), gaining $+53$--$59$ pp. Standard test-time methods (self-consistency, Best-of-$N$, Self-Refine) \emph{underperform} outcome-only reprompting on causal tasks, while ERM reduces residual Rung Collapse from 55--70\% to 4\%. A separation theorem proves outcome-only reward cannot close this gap; a controlled simulation confirms epistemic feedback does, outperforming outcome-only baselines 38-fold.

📄 PDF Abstract BibTeX arXiv:2602.11675

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Causal Bandit Approach to Learning Good Atomic Interventions in Presence of Unobserved Confounders

2021-07-06 · Aurghya Maiti, Vineet Nair, Gaurav Sinha

We study the problem of determining the best intervention in a Causal Bayesian Network (CBN) specified only by its causal graph. We model this as a stochastic multi-armed bandit (MAB) problem with side-information, where…

Trivium: Temporal Regret as a First-Class Objective for Causal-Memory Controllers

2026-06-03 · Edward Y. Chang arxiv

Many current agentic systems and LLM pipelines correct mistakes by optimizing outcome reward. This addresses only the what of failure: when an outcome diverges from prediction, the why and when of the mismatch are not sy…

Graph Learning Is Suboptimal in Causal Bandits

2025-10-19 · Mohammad Shahverdikondori, Jalal Etesami, Negar Kiyavash arxiv

We study regret minimization in causal bandits under causal sufficiency where the underlying causal structure is not known to the agent. Previous work has focused on identifying the reward's parents and then applying cla…

Graph Learning

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits

2026-05-25 · Yunlong Hou, Zixin Zhong, Vincent Y. F. Tan arxiv

We study a stochastic multi-armed bandit problem where an agent is granted a free exploration budget before regret accumulates, a setting not captured by the classic regret minimization or pure exploration paradigms. The…

Multi-Armed Bandits

A Message Passing Realization of Expected Free Energy Minimization

2025-08-04 · Wouter W. L. Nuijten, Mykola Lukashchuk, Thijs van de Laar, Bert de Vries arxiv

We present a message passing approach to Expected Free Energy (EFE) minimization on factor graphs, based on the theory introduced in arXiv:2504.14898. By reformulating EFE minimization as Variational Free Energy minimiza…