2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.AI2017★ 2 cited
Exploration in Feature Space for Reinforcement Learning
Suraj Narayanan Sasikumar
The infamous exploration-exploitation dilemma is one of the oldest and most important problems in reinforcement learning (RL). Deliberate and effective exploration is necessary for…
cs.AI2017
Count-Based Exploration in Feature Space for Reinforcement Learning
Jarryd Martin, Suraj Narayanan Sasikumar, Tom Everitt +1
We introduce a new count-based optimistic exploration algorithm for Reinforcement Learning (RL) that is feasible in environments with high-dimensional state-action spaces. The succ…