arXiv (All)
open access
Provably Efficient Reward Transfer in Reinforcement Learning with Discrete Markov Decision Processes
In this paper, we propose a new solution to reward adaptation (RA) in reinforcement learning, where the agent adapts to a target reward function based on one or more existing source behaviors learned a priori under the same domain dynamics but different reward functions. While learning the target be
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
- Provably Efficient Reward Transfer in Reinforcement Learning with Discrete Markov Decision Processes#783458
- Theoretical Considerations of Potential-Based Reward Shaping for Multi-Agent Systems#638157
- ARS: Agentic Reward System for Robot Learning#1128753
- Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics#1069797
- Provably Optimal Reinforcement Learning under Safety Filtering#1034680
Record · ID 785048
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