Markov flow policy -- deep MC
Not on the map. Why?
Abstract (arXiv)
Discounted algorithms often encounter evaluation errors due to their reliance on short-term estimations, which can impede their efficacy in addressing simple, short-term tasks and impose undesired temporal discounts ((γ)). Interestingly, these algorithms are often tested without applying a discount, a phenomenon we refer as the textittrain-test bias. In response to these challenges, we propose the Markov Flow Policy, which utilizes a non-negative neural network flow to enable comprehensive forward-view predictions. Through integration into the TD7 codebase and evaluation using the MuJoCo benchmark, we observe significant performance improvements, positioning MFP as a straightforward, practical, and easily implementable solution within the domain of average rewards algorithms.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 16 references that are in the map. First posted on arXiv 1 May 2024.
Builds on
6 of 16 references.
References · 6
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
- 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 392
- 2022Trajectory balance: Improved credit assignment in GFlowNetscited by 251
- 2023For SALE: State-Action Representation Learning for Deep Reinforcement Learningcited by 75
Built on by
Not cited yet.