all AI news
On the Sample Efficiency of Abstractions and Potential-Based Reward Shaping in Reinforcement Learning
April 12, 2024, 4:42 a.m. | Giuseppe Canonaco, Leo Ardon, Alberto Pozanco, Daniel Borrajo
cs.LG updates on arXiv.org arxiv.org
Abstract: The use of Potential Based Reward Shaping (PBRS) has shown great promise in the ongoing research effort to tackle sample inefficiency in Reinforcement Learning (RL). However, the choice of the potential function is critical for this technique to be effective. Additionally, RL techniques are usually constrained to use a finite horizon for computational limitations. This introduces a bias when using PBRS, thus adding an additional layer of complexity. In this paper, we leverage abstractions to …
abstract abstractions arxiv cs.ai cs.lg efficiency function however reinforcement reinforcement learning research sample type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Lead Developer (AI)
@ Cere Network | San Francisco, US
Research Engineer
@ Allora Labs | Remote
Ecosystem Manager
@ Allora Labs | Remote
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote