CausalSmith · seminar slides

Hidden-State Overlap in POMDP Policy Evaluation

We characterize the minimax risk for stationary off-policy evaluation from one finite POMDP trajectory, and a radius-calibrated partial-history estimator attains the full overlap frontier.

Overview

  • We observe one stationary behavior trajectory with observed state, action, and reward.
  • The Markov state has an unobserved component.
  • Behavior and target policies are known functions of the observed state.
  • We study the stationary target-policy mean reward.
  • The key population control is latent stationary overlap: target occupancy is bounded by behavior occupancy on the full observed-latent state.
  • The risk surface depends on the overlap-distance radius qCq_C, mixing scale t0t_0, and log-overlap scale ζ\zeta.

informal · Theorem T-5 Uniformly over finite observed and latent alphabets, the minimax risk is comparable to the all-radius frontier, and a radius-calibrated PHIW estimator attains the upper bound.

Motivation

  • In mobile health and treatment-policy evaluation, we often observe a coarse context but miss clinically relevant latent state.
  • A target policy may change the long-run mix of latent states, even when actions are randomized with known probabilities.
  • Current-action weighting corrects the action choice at the current observed state.
  • Longer observable histories can partially recover the latent occupancy shift created by the target policy.
  • The central question is: how much history is statistically worth using?

Running Example

  • Think of an insulin policy that treats when observed glucose exceeds a threshold.
  • Diet history is latent, but it affects future glucose and treatment needs.
  • The behavior policy randomizes treatment, while the target policy follows the glucose threshold.
  • One-step policy overlap controls action probabilities at observed glucose levels.
  • Latent stationary overlap controls how far the target policy can move the stationary diet-glucose distribution.
  • The theory chooses history length from that stationary-overlap radius.

Setup

  • The joint state is St=(Xt,Ht)S_t=(X_t,H_t): observed state XtX_t and latent state HtH_t.
  • The behavior policy bb generates the data; the target policy ee defines the counterfactual value.
  • We observe (Xt,At,Yt)(X_t,A_t,Y_t) for t=0,,T1t=0,\ldots,T-1.
  • Rewards are bounded, and the trajectory starts in the behavior stationary law.
  • The target estimand is the stationary mean reward under the target policy.
Definition P-2 (Target value \(\theta(K,e)\))

For the joint state StS_t and the target-policy reward regression geg_e, θ(K,e):=s=(x,h)Sde(s)ge(s)=s=(x,h)Sde(s)aAe(ax)EK[YtSt=s,At=a]. \theta(K,e) := \sum_{s=(x,h)\in\mathcal S} d_e(s)g_e(s) = \sum_{s=(x,h)\in\mathcal S} d_e(s) \sum_{a\in\mathcal A} e(a\mid x)\,E_K[Y_t\mid S_t=s,A_t=a].

Assumptions

  • The process is a finite POMDP with a time-homogeneous reward-transition kernel.
  • Sequential ignorability holds at the observed state: actions are drawn from b(Xt)b(\cdot\mid X_t).
  • One-step policy overlap bounds e(ax)/b(ax)e(a\mid x)/b(a\mid x) by L=exp(ζ)L=\exp(\zeta).
  • Uniform contraction gives geometric forgetting under both behavior and target policies.
  • Latent stationary overlap bounds the target stationary law ded_e by CdbC d_b on the full joint state.
Assumption A-7 (Latent stationary overlap)

For the overlap constant CC and experiment MM, the latent stationary overlap condition holds when C1C\ge 1 and, writing ded_e and dbd_b for the stationary laws of the target-policy and behavior-policy joint-state transition kernels, respectively, de(s)Cdb(s),sS. d_e(s)\le C\,d_b(s), \qquad s\in\mathcal S .

Estimator

  • Partial-history importance weighting uses only the last k+1k+1 observable policy ratios.
  • Larger kk reduces latent-history bias through mixing.
  • Larger kk increases variance through products of one-step ratios.
  • Clipping keeps the estimate on the reward scale.
Definition P-4 (Partial-history estimator \(\widehat\theta_k\))

For 0k<T0\le k<T, define Zt(k):=Ytj=tktρj, Z_t(k) := Y_t\prod_{j=t-k}^{t}\rho_j, where ρt\rho_t is the observable one-step policy ratio with the zero-cell convention. The clipped partial-history importance-weighted estimator is θ^k:=clip[1,1]{1Tkt=kT1Zt(k)}. \widehat\theta_k := \operatorname{clip}_{[-1,1]} \left\{ \frac{1}{T-k}\sum_{t=k}^{T-1} Z_t(k) \right\}.

Radius Calibration

  • The normalized overlap-distance radius is qC=(C1)/Cq_C=(C-1)/C.
  • At qC=0q_C=0, target and behavior stationary occupancies coincide.
  • As qCq_C grows, longer observable histories become useful.
  • The supplied radius CC determines the depth used by the estimator.
Definition P-10 (Overlap-distance radius \(q_C\))

For C1C\ge 1, define qC:=C1C. q_C:=\frac{C-1}{C}.

Definition P-11 (Radius-calibrated history depth \(\kappa_T^{\mathrm{rad}}(C)\))

For TNT\in\mathbb N and C1C\ge 1, define κTrad(C):={0,TqC21,min ⁣{T2,log(TqC2)2log(1/α)+logL},TqC2>1. \kappa_T^{\mathrm{rad}}(C):= \begin{cases} 0, & Tq_C^2\le 1,\\[3pt] \displaystyle \min\!\left\{ \left\lfloor\frac T2\right\rfloor, \left\lfloor\frac{\log(Tq_C^2)}{2\log(1/\alpha)+\log L}\right\rfloor \right\}, & Tq_C^2>1. \end{cases}

Main Result

  • The frontier has a parametric term and a hidden-state term.
  • The elbow occurs when the overlap-distance radius is on the T1/2T^{-1/2} scale.
  • The constants depend on t0t_0 and ζ\zeta, while the statement is uniform over finite alphabets.
Theorem T-5 (Uniform overlap frontier)

Fix t0>0t_0>0 and ζ>0\zeta>0. Let RT(t0,ζ,C)R_T(t_0,\zeta,C) be the minimax squared-error risk in Definition P-3, let qC=(C1)/Cq_C=(C-1)/C be the overlap-distance radius in Definition P-10, and set β=22+t0ζ,rT(t0,ζ,C)=T1+TβqC2(1β). \beta=\frac{2}{2+t_0\zeta}, \qquad \mathfrak r_T(t_0,\zeta,C) = T^{-1}+T^{-\beta}q_C^{2(1-\beta)} . There exist constants clo,chi>0c_{\mathrm{lo}},c_{\mathrm{hi}}>0, with clochic_{\mathrm{lo}}\le c_{\mathrm{hi}}, and an integer T1T_\star\ge 1, all depending only on t0t_0 and ζ\zeta, such that for every C1C\ge 1 and every TTT\ge T_\star, clorT(t0,ζ,C)RT(t0,ζ,C)chirT(t0,ζ,C), c_{\mathrm{lo}}\mathfrak r_T(t_0,\zeta,C) \le R_T(t_0,\zeta,C) \le c_{\mathrm{hi}}\mathfrak r_T(t_0,\zeta,C), and the radius-adaptive partial-history importance-weighted estimator with depth κTrad(C)\kappa_T^{\mathrm{rad}}(C) from Definition P-11 satisfies supmMT(t0,ζ,C)Em ⁣[(θ^κTrad(C)θm)2]chirT(t0,ζ,C). \sup_{m\in\mathcal M_T(t_0,\zeta,C)} \mathbb E_m\!\left[ \bigl(\widehat\theta_{\kappa_T^{\mathrm{rad}}(C)}-\theta_m\bigr)^2 \right] \le c_{\mathrm{hi}}\mathfrak r_T(t_0,\zeta,C). Moreover, for every sequence CT1C_T\ge 1, if TqCT2Tq_{C_T}^2 is eventually bounded, then there is a constant cimm>0c_{\mathrm{imm}}>0, depending on the sequence and on t0,ζt_0,\zeta, such that eventually supmMT(t0,ζ,CT)Em ⁣[(θ^0θm)2]cimmT. \sup_{m\in\mathcal M_T(t_0,\zeta,C_T)} \mathbb E_m\!\left[ \bigl(\widehat\theta_{0}-\theta_m\bigr)^2 \right] \le \frac{c_{\mathrm{imm}}}{T}.

Fixed-radius Slice

informal · Theorem T-1 For every fixed C>1C>1, the minimax risk is between constants times TβT^{-\beta}, and clipped PHIW at the balanced depth attains the upper bound.

Theorem T-1 (Fixed-overlap minimax rate)

Fix t0,ζ,CRt_0,\zeta,C\in\mathbb R. Assume:

  • (Positive memory exponent.) t0>0t_0>0.
  • (Positive overlap exponent.) ζ>0\zeta>0.
  • (Fixed latent-overlap radius.) C>1C>1.

Let the exponent β\beta be β=22+t0ζ. \beta=\frac{2}{2+t_0\zeta}. There exist constants c,cRc_\star,c^\star\in\mathbb R and an integer T1T_\star\ge 1 such that 0<cc 0<c_\star\le c^\star and, for every integer TTT\ge T_\star, cTβRT(t0,ζ,C)cTβ, c_\star T^{-\beta} \le R_T(t_0,\zeta,C) \le c^\star T^{-\beta}, where RT(t0,ζ,C)R_T(t_0,\zeta,C) is the minimax squared-error risk in Definition P-3. Moreover, the clipped partial-history importance-weighted estimator θ^kT\widehat\theta_{k_T}, with kTk_T as in Definition P-5, satisfies supMMT(t0,ζ,C)EM ⁣[{θ^kTθ(M)}2]cTβ, \sup_{M\in\mathcal M_T(t_0,\zeta,C)} \mathbb E_M\!\left[ \{\widehat\theta_{k_T}-\theta(M)\}^2 \right] \le c^\star T^{-\beta}, with θ(M)\theta(M) the stationary target-policy mean reward in Definition P-2. For each integer TTT\ge T_\star, there is an integer Q1Q\ge 1 such that the lower bound is witnessed by the two signed-depth alternatives MQ,vTM_{Q,v}^T, v{1,+1}v\in\{-1,+1\}, generated by Definition P-6 with one observed state and 2(Q+1)2(Q+1) latent states: for every measurable observable-data estimator θ^\widehat\theta, under the usual squared-error integrability conditions for both alternatives, cTβmaxv{1,+1}EMQ,vT ⁣[{θ^θ(MQ,vT)}2]. c_\star T^{-\beta} \le \max_{v\in\{-1,+1\}} \mathbb E_{M_{Q,v}^T}\!\left[ \{\widehat\theta-\theta(M_{Q,v}^T)\}^2 \right].

Boundary Slice

informal · Theorem T-2 At unit latent overlap, the behavior and target stationary laws coincide, immediate weighting has at most order T1T^{-1} risk, and the minimax risk is on the T1T^{-1} scale.

Theorem T-2 (Unit overlap boundary)

Let t0>0t_0>0 and ζ>0\zeta>0. At unit latent overlap, C=1C=1, the following assertions hold. For every trajectory length TT, every finite observed and hidden state cardinalities, and every experiment MMT(t0,ζ,1)M\in\mathcal M_T(t_0,\zeta,1) in the model class of Definition P-1, the target stationary law ded_e and the behavior stationary law dbd_b of the corresponding policy-induced joint-state transition kernels coincide: de=db. d_e=d_b . Moreover, there is a constant cimm>0c_{\mathrm{imm}}>0, depending only on t0t_0 and ζ\zeta, such that for every integer T1T\ge 1, the worst-case squared risk of the immediate observable estimator θ^0\widehat\theta_0 satisfies supMMT(t0,ζ,1)EM ⁣[(θ^0θ(K,e))2]cimmT. \sup_{M\in\mathcal M_T(t_0,\zeta,1)} \mathbb E_M\!\left[\bigl(\widehat\theta_0-\theta(K,e)\bigr)^2\right] \le \frac{c_{\mathrm{imm}}}{T}. Finally, for the minimax squared-error risk RT(t0,ζ,1)R_T(t_0,\zeta,1) of Definition P-3, there are constants clo,chi>0c_{\mathrm{lo}},c_{\mathrm{hi}}>0 with clochic_{\mathrm{lo}}\le c_{\mathrm{hi}} and an integer T1T_\star\ge 1 such that, for every TTT\ge T_\star, cloTRT(t0,ζ,1)chiT. \frac{c_{\mathrm{lo}}}{T} \le R_T(t_0,\zeta,1) \le \frac{c_{\mathrm{hi}}}{T}. The hidden-state exponent at these positive scales satisfies 22+t0ζ<1. \frac{2}{2+t_0\zeta}<1 .

Local Slice

informal · Theorem T-4 Along shrinking radii CT=1+δTC_T=1+\delta_T, the minimax risk is comparable to the local frontier, and immediate weighting attains a parametric bound when TδT2T\delta_T^2 stays bounded.

Theorem T-4 (Shrinking-overlap frontier)

The following conditions hold:

  • (Fixed smoothness.) The constants satisfy t0>0t_0>0 and ζ>0\zeta>0.
  • (Shrinking radius.) The deterministic radius excess sequence (δT)T1(\delta_T)_{T\ge1} satisfies δT0\delta_T\ge0 for every TT.
  • (Local limit.) The sequence satisfies δT0\delta_T\to0.
  • (Rate exponent.) Let β=2/(2+t0ζ)\beta=2/(2+t_0\zeta).
  • (Local rate and depth.) Define rT(δ)=T1+TβδT2(1β) r_T(\delta) = T^{-1}+T^{-\beta}\delta_T^{2(1-\beta)} and κT={0,TδT21,min{T/2,log(TδT2)2log(1/α)+logL},TδT2>1. \kappa_T = \begin{cases} 0, & T\delta_T^2\le 1,\\[3pt] \displaystyle \min\left\{\left\lfloor T/2\right\rfloor, \left\lfloor \frac{\log(T\delta_T^2)} {2\log(1/\alpha)+\log L} \right\rfloor\right\}, & T\delta_T^2>1. \end{cases}

Then there exist constants cloc,Clocc_{\mathrm{loc}},C_{\mathrm{loc}} with 0<clocCloc0<c_{\mathrm{loc}}\le C_{\mathrm{loc}}, depending only on t0t_0 and ζ\zeta, such that, for all sufficiently large TT, clocrT(δ)RT(t0,ζ,1+δT)ClocrT(δ), c_{\mathrm{loc}}\,r_T(\delta) \le R_T(t_0,\zeta,1+\delta_T) \le C_{\mathrm{loc}}\,r_T(\delta), where RTR_T is the minimax squared-error risk in Definition P-3. Moreover, the observable partial-history importance-weighted estimator θ^κT\widehat\theta_{\kappa_T} of Definition P-4 satisfies supMMT(t0,ζ,1+δT)EM ⁣[(θ^κTθ(M))2]ClocrT(δ) \sup_{M\in\mathcal M_T(t_0,\zeta,1+\delta_T)} \mathbb E_M\!\left[ \bigl(\widehat\theta_{\kappa_T}-\theta(M)\bigr)^2 \right] \le C_{\mathrm{loc}}\,r_T(\delta) for all sufficiently large TT. Finally, if there is a constant D0D\ge0 such that TδT2DT\delta_T^2\le D for all sufficiently large TT, then there is a constant cimm>0c_{\mathrm{imm}}>0 such that supMMT(t0,ζ,1+δT)EM ⁣[(θ^0θ(M))2]cimmT \sup_{M\in\mathcal M_T(t_0,\zeta,1+\delta_T)} \mathbb E_M\!\left[ \bigl(\widehat\theta_{0}-\theta(M)\bigr)^2 \right] \le \frac{c_{\mathrm{imm}}}{T} for all sufficiently large TT.

Related Literature

  • Hu and Wager (2023) give the closest POMDP baseline: partial-history weighting with the hidden-state exponent β=2/(2+t0ζ)\beta=2/(2+t_0\zeta).
  • We keep the same finite POMDP, known-policy, bounded-reward, mixing, and one-step-overlap setting.
  • Our additional population control is latent stationary overlap on the full observed-latent state.
  • Mehrabi and Wager (2025) provide the closest fully observed overlap comparator through stationary density-ratio control.
  • Proxy and bridge approaches impose additional observability structure; our results quantify the partial-history route under latent stationary overlap.

Key Idea

Observed Trajectory behavior path horizon T Known Policies behavior and target Overlap Radius latent stationary q_C Contraction Bias remote history fades after window k Ratio Variance extra steps multiply policy ratios Calibrated Depth window length k from Tq_C² Clipped Averaging partial-history weights bounded contribution Target Estimate stationary value illustrative
illustrative Box-and-arrow schematic showing observed trajectory and known policies feeding partial-history weighting, radius-calibrated depth selection, clipped averaging, and the stationary target-value estimate.
  • The estimator balances two forces.
  • Bias shrinks because contraction makes remote latent history less relevant after a length-kk observed window.
  • Variance grows because each extra step multiplies another observable policy ratio.
  • Latent stationary overlap scales the bias by qCq_C.
  • The calibrated depth sets the window length from the effective radius TqC2Tq_C^2.

Lower-bound Idea

Observed state one constant state Observed path actions and rewards Hidden coords depth and sign Rare histories move latent state Terminal depth hard to detect Reward sign terminal + Reward sign terminal − Target value differs by sign
illustrative Box-and-arrow schematic showing a constant observed state, hidden depth and sign coordinates, rare action histories leading to terminal depth, and two reward-sign alternatives.
  • The hard pair has one observed state, so the econometrician sees actions and rewards but not latent depth.
  • Rare action histories move the latent state toward a terminal depth.
  • The target value differs through the terminal sign.
  • The observed laws remain close because the terminal state is hard to detect from the observed path.
  • The reset-sign perturbation keeps latent stationary overlap within the prescribed radius.

Insulin Demonstration

  • The finite grid has 360 joint states with latent diet coordinates.
  • The behavior policy treats with probability 0.30.3.
  • The target policy treats when glucose is at least 125125.
  • The refresh component gives one-half contraction.
  • The certified stationary overlap constant is C=720C=720.
  • Immediate weighting has a strictly negative certified stationary bias interval.

informal · Theorem T-3 In the refreshed insulin grid, the structural constants satisfy the theorem’s contraction, action-overlap, and stationary-overlap conditions, while immediate weighting has certified negative bias.

Theorem T-3 (Finite insulin witness)

For every horizon TT, the refreshed insulin experiment Igrid\mathcal I_{\mathrm{grid}} of Definition P-9 satisfies:

  • (State count.) Its observed--latent joint-state alphabet has cardinality 904=36090\cdot 4=360.
  • (Uniform contraction.) It satisfies Assumption A-6 with contraction parameter α=1/2\alpha=1/2.
  • (Policy overlap.) It satisfies Assumption A-5 with one-step overlap constant L=10/3L=10/3.
  • (Stationary overlap.) It satisfies Assumption A-7 with stationary-overlap constant C=720C=720.

Define the immediate-weighting bias diagnostic by Δimm(T)=sdb(s)a{0,1}b(asX)e(asX)b(asX)rK(ds,drs,a)θ(K,e), \Delta_{\mathrm{imm}}(T) = \sum_s d_b(s)\sum_{a\in\{0,1\}} b(a\mid s_X)\, \frac{e(a\mid s_X)}{b(a\mid s_X)} \int r\,K(ds',dr\mid s,a) - \theta(K,e), where K,b,eK,b,e are the transition kernel, behavior policy, and target policy of Igrid\mathcal I_{\mathrm{grid}}, sXs_X is the observed coordinate of ss, and dbd_b is the stationary law induced by bb. This diagnostic is interval-certified as strictly negative: 0.006<Δimm(T)<0.0058. -0.006 < \Delta_{\mathrm{imm}}(T) < -0.0058 .

Takeaways

  • Latent stationary overlap gives a quantitative radius for stationary POMDP off-policy evaluation.
  • The all-radius frontier is T1T^{-1} plus the hidden-state partial-history term scaled by qCq_C.
  • Fixed positive radius recovers the Hu-Wager partial-history exponent.
  • Unit overlap and sufficiently small local radii yield the parametric scale.
  • Radius-calibrated PHIW is the constructive estimator matched to this frontier.