arXiv (All)
open access
Gated Q-learning: Add Off-Policy Bias to Taste
Multistep credit assignment is critical for sample-efficient reinforcement learning, yet managing off-policy bias in Q-learning remains a fundamental challenge. For 30 years, practitioners have been limited to a binary choice: eliminate the bias at the cost of severely truncated eligibility traces (
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
- Selective Successor Eligibility Traces for RLVR#1343575
- Train Short, Act Long: Multistability and the Horizon Independence of Recurrent Policies#1327386
- Beyond Scalar IoU: Structured Verification from Rollout Groups for Video Temporal Grounding#1216976
- Where the Model Changes Its Mind: Hindsight-Divergence Localization for Efficient Reinforcement Learning with Verifiable Rewards#1132065
- Fast Non-Episodic Finite-Horizon RL with K-Step Lookahead Thresholding#1342404
Record · ID 1326367
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