arXiv (All)
open access
Lifted Bellman Linear Programming for Offline Reinforcement Learning
Offline reinforcement learning (RL) typically trains a critic by minimizing a regression loss against bootstrapped value targets stabilized by target networks with exponential moving average (EMA) updates. Multi-step targets incorporate behavior-policy actions and therefore require off-policy correc
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
- Lifted Bellman Linear Programming for Offline Reinforcement Learning#1028719
- Multi-step Proximal Policy Improvement in Offline Reinforcement Learning#639687
- HiRE: Hindsight Reward Editing for Policy Finetuning#1063279
- Role-Adaptive Policy Optimization for Offline Reinforcement Learning#1154415
- Role-Adaptive Policy Optimization for Offline Reinforcement Learning#1136828
Record · ID 1050662
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