OSCC: Certified Observation-Safe Coupling Optimization for Gradient-Noise Control in Imperfect-Information Learning
Not on the map. Why?
Abstract (arXiv)
Coupled rollouts can reduce the noise of counterfactual action comparisons, but two issues prevent standard common-random-number constructions from serving as a general learning primitive in imperfect-information environments. First, an invalid coupling may expose hidden state, synchronize endogenous policy randomness, or misalign chance events after counterfactual histories diverge. Second, in multi-action policy optimization, lower return-contrast variance is not by itself the relevant objective: the optimizer depends on the return covariance matrix after projection through the local policy-gradient geometry. We introduce observation-safe counterfactual coupling (OSCC), a framework that defines an admissible class through marginal preservation, information-state safety, branch-local policy randomness, semantic event alignment, and trace-before-oracle replay. We derive a gradient-aware coupling criterion showing that, for marginal-preserving couplings, policy-gradient noise changes are determined by policy-Jacobian-weighted off-diagonal return covariance. This motivates OSCC-Select, a calibration-only selector that chooses among independent, root-only, continuation-only, and fully coupled rollouts using separate safety and gain certificates. Its gain target combines projected gradient noise with measured physical sampling cost and falls back to independent sampling whenever a simultaneous lower confidence bound does not certify improvement. On 100,000 fixed-root Leduc comparisons, the fully coupled CP-GRPO instantiation reduces return-contrast variance from 41.1158 to 18.1441, a 55.87% reduction, while preserving the declared branch marginals. With three actions, OSCC-Select chooses continuation coupling and attains gradient-noise trace 0.0783 versus 0.0917 for return-variance selection. Increasing calibration from 64 to 2,048 groups raises certification from 0.327 to 0.995.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 32 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
8 of 32 references.
References · 8
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
- 2020D4RL: Datasets for Deep Data-Driven Reinforcement Learningcited by 1,427
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
- 2019OpenSpiel: A Framework for Reinforcement Learning in Gamescited by 186
- 2016Deep Reinforcement Learning from Self-Play in Imperfect-Information Gamescited by 158
- 2026Using Common Random Numbers for Simulation-based Planning with Rolloutscited by 5
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Why Semantic Entropy Fails: Geometry-Aware and Calibrated Uncertainty for Policy Optimization
- 2025Noise-corrected GRPO: From Noisy Rewards to Unbiased Gradients
- 2026Counterfactual Generation via Flow Matching: Coupling-Sensitive End-to-End Rates
- 2026Stable but Wrong: When Learning Stabilizes Away from the Truth
- 2026Safe RLHF Beyond Expectation: Stochastic Dominance for Universal Spectral Risk Control
- 2026Non-Uniform Noise-to-Signal Ratio in the REINFORCE Policy-Gradient Estimator
- 2025Viability of Future Actions: Robust Safety in Reinforcement Learning via Entropy Regularization
- 2026Overcoming Valid Action Suppression in Unmasked Policy Gradient Algorithms