Executed-Action and Intervention-Aware Replay
Implementation & benchmark of arXiv:2608.04732 — Toward Integrating Adaptive Experience Replay and Online Uncertainty Estimation in Safe Actor-Critic Optimal Control
Source paper: Toward Integrating Adaptive Experience Replay and Online Uncertainty Estimation in Safe Actor-Critic Optimal Control arXiv:2608.04732 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Train the critic on the action that the environment actually received after safety filtering, not only on the actor's nominal action. Prioritize transitions whose estimation residual, barrier proximity, or filter intervention is large, so replay concentrates on the distribution shift introduced by the safety controller instead of repeatedly sampling benign nominal behavior.
Formulas
Mathematical statement
For a transition (s, u_nom, u_exec, r, s_prime), the Bellman target must use the action that caused the environment transition. For deterministic actor-critic training, use y = r + gamma Q_target(s_prime, pi_target(s_prime)) and fit Q_phi(s, u_exec) to y. Define priority q_i = lambda_delta |delta_i| + lambda_I I_i + lambda_e e_i + lambda_h divided by (h_i + epsilon_0), where delta_i is the TD residual, I_i = ||u_exec,i - u_nom,i|| squared is intervention magnitude, e_i is normalized estimation residual, and h_i is the observed barrier margin. Prioritized replay samples transition i with probability p_i proportional to (q_i + epsilon_0)^alpha, while importance weights w_i = (N p_i)^(-beta) reduce sampling bias.
Implementation notes
1. Integration point: modify any off-policy actor-critic replay buffer. During collection, retain s, u_nom, u_exec, r, s_prime, barrier margin h, uncertainty residual e, and intervention norm I. During updates, feed u_exec to the critic; the actor can still be optimized through a differentiable safety layer or with a detached filter initially. 2. Pseudocode: insert the transition; compute q_i from the current TD error and stored safety statistics; sample with p_i proportional to (q_i plus epsilon_0)^alpha; apply importance weights; update critic and actor; recompute sampled TD errors and priorities. Start with alpha = 0.6 and beta = 0.4, then compare against uniform replay and ordinary TD-error prioritization. 3. Computed versus estimated: executed actions, intervention norms, and residuals are directly logged; TD errors are estimated by the current critic and priorities are stale between updates. Normalize each priority component by a running median or percentile so one term does not dominate. 4. First cheap experiment: train TD3 or SAC on a two-dimensional navigation task where a CBF modifies 5 to 30 percent of actions. Compare nominal-action critic plus uniform replay, executed-action critic plus uniform replay, and the full priority rule under equal environment steps. The prediction is that critic error on intervention transitions decreases faster and actor instability occurs at a larger intervention fraction. Sweep intervention probability and measure the crossover: executed-action training should outperform nominal-action training once more than about 10 percent of stored actions are altered. Also test whether the priority histogram shifts toward high-residual and high-intervention samples and whether success improves without increasing empirical contact rate.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.