Primal-dual algorithms for discounted Markov decision processes
By Randy Cogill. 2015
6 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications
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
In Computational Theory and Mathematics
In Computer Networks and Communications
Citations in the corpus
- Boosting the Actor with Dual Critic (2017, methodology): “…duality have been utilized for (approximate) planning problem (de Farias and Roy, 2004; Wang et al., 2008; Pazis and Parr, 2011; O’Donoghue et al., 2011; Malek et al., 2014; Cogill, 2015), in which the transition probability of the MDP is known and the value function or policy are in tabular form.”
- Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning (2016, neutral): “− Cogill (2015) considered the exact primal-dual method for MDP with full knowledge and interpreted it as a form of value iteration.”
- An online primal-dual method for discounted Markov decision processes (2016, methodology): “In a recent paper [9], the exact primaldual method was considered for MDP with full knowledge.”