arXiv (All)
open access
When KL Regularization Misfires in Group Policy Optimization
Why does removing reference-policy KL regularization sometimes improve group policy optimization? This motivates studying how reference-policy information should enter group-relative updates. We analyze seven potential failure modes in the interactions between KL and rewards: residual KL updates aft
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- RSD-Poker: Structure-Adaptive and Shift-Robust Risk-Utility Certification for Residual Policies in Imperfect-Information Games#1118742
- Beyond Importance Sampling: Rejection-Gated Policy Optimization#19038
- Security-Induced Braess Paradoxes in Service Function Chain Orchestration#282721
- Reinforcement learning in the Game of Hidden Rules: Representation, transfer, and generalization#352232
- Eligibility Propagation to Speed up Time Hopping for Reinforcement Learning#478179
Record · ID 1249585
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive