arXiv (All)
open access
Multi-Fidelity Policy Gradients Stabilize Data-Scarce Reinforcement Learning
Policy gradient methods for on-policy reinforcement learning (RL) can become unstable when expensive, scarce target-domain data yield noisy gradient estimates. We address this challenge by complementing limited high-fidelity (HF) target-domain data with abundant, cheap, but biased low-fidelity (LF)
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
- ReSPO: Reshaped Sequence Policy Optimization for Gradient Starvation in Off-Policy Learning#1130021
- Offline Policy Evaluation via Mixed Bellman Residuals and Adaptive Critic Representations#1117898
- Generative Support Realignment for Cross-Domain Offline Reinforcement Learning#1131532
- Official Review · ICLR 2025#787007
- Guide, Then Let Go: Gap-Adaptive Teacher Scheduling for Sparse-Reward Agentic RL#1142204
Record · ID 1186819
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