Using continuous action spaces to solve discrete problems
By Hado van Hasselt, Marco A. Wiering. 2009
72 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Georgios Theocharous
- Philip S. Thomas
- Yash Chandak
- Hado van Hasselt
- Emma Jordan
- James E. Kostas
- Sergey Levine
- Emma Brunskill
In Computational Theory and Mathematics
- Philip S. Thomas
- Emma Jordan
- Georgios Theocharous
- James E. Kostas
- Yash Chandak
- Hado van Hasselt
- Xue Bin Peng
- Michiel van de Panne
Citations in the corpus
- Learning Action Representations for Reinforcement Learning (2019, background): “To deal with discrete actions that might have an underlying continuous representation, Van Hasselt and Wiering [2009] used policy gradients with continuous actions and selected the nearest discrete action.”
- Reinforcement Learning in Continuous State and Action Spaces (2012, methodology): “In this section we discuss the continuous actor-critic learning-automaton (Cacla) algorithm (van Hasselt and Wiering, 2007, 2009).”