Skip to main content
Search

# Off-policy evaluation

3 related articles

Subscribe to updates
  1. arXiv

    How much of a policy's value comes from reacting to state: a covariance identity isolates adaptivity, but deterministic policies cannot be audited from their own logs

    When a regulator evaluates a learned policy, the inputs and outputs are usually all that is visible, so it is hard to tell whether value comes from acting on the state or from average behavior. This work shows that, in a finite-horizon Markov decision process, the expected-cost difference between a policy and its open-loop marginal equals exactly the covariance between state and action, and it bounds adaptive value by the mutual information the policy uses. Auditing that quantity under bandit feedback needs a sample size inversely proportional to an average KL divergence, while a deterministic non-constant policy is not identifiable from its own logs.

  2. arXiv

    A causal answer to whether an AI agent should be reviewed mid-task: randomized interventions inside one trajectory show effects swing by action and state

    Agent evaluation has relied on fixed benchmarks that report task success or failure but cannot say whether reviewing or steering an agent mid-trajectory is worth it at deployment. Researchers bring micro-randomized trials into agent trajectories, assigning review or direct execution with equal probability at each eligible decision, then estimate causal effects with augmented inverse probability weighting and structural nested mean models. On τ-bench Retail, ToolSandbox and ImpossibleBench, review effects vary substantially across tool-call types and agent states, and the same data yield decision-group risk rankings.

  3. arXiv

    Training logs know what deployment cannot: runtime-confounded RL gets doubly robust evaluation and a testable price

    When deployment lacks key variables that training logs record in full, runtime confounding can push a reinforcement-learning policy off course over time. The work places the runtime restriction only in the numerator of an importance ratio and estimates nuisance functions from the full data, yielding an asymptotically normal off-policy estimator that attains the semiparametric efficiency bound, a policy-learning regret bound that differs from the full-information optimum by an irreducible runtime gap, and a sample-splitting test for that gap.

You’re all caught up