Lipschitz Continuity of Value Functions in Markovian Decision Processes
By Karl Hinderer. 2005
73 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering, Management Science and Operations Research, Reinforcement Learning, Statistical Learning Theory
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Yuanzhi Li
- Tengyu Ma
- Trevor Darrell
- Marcello Restelli
- Marc G. Bellemare
- Luca Bascetta
- Huazhe Xu
- Yuandong Tian
In Industrial and Manufacturing Engineering
- Trevor Darrell
- Marcello Restelli
- Marc G. Bellemare
- Luca Bascetta
- Saurabh Kumar
- Yuandong Tian
- Matteo Pirotta
- Ofir Nachum
In Management Science and Operations Research
- Carles Gelada
- Ofir Nachum
- Saurabh Kumar
- Jacob Buckman
- Trevor Darrell
- Marcello Restelli
- Marc G. Bellemare
- Tengyu Ma
In Reinforcement Learning
- Sergey Levine
- Pieter Abbeel
- Ofir Nachum
- Tengyu Ma
- Marc G. Bellemare
- Carles Gelada
- Huazhe Xu
- Saurabh Kumar
In Statistical Learning Theory
- Yuanzhi Li
- Tengyu Ma
- Trevor Darrell
- Marcello Restelli
- Marc G. Bellemare
- Luca Bascetta
- Yuandong Tian
- Carles Gelada
Citations in the corpus
- DeepMDP: Learning Continuous Latent Space Models for Representation Learning (2019, background): “1 and if for all a P A : Several works have studied Lipschitz norm constraints on the transition and reward functions (Hinderer, 2005; Asadi et al., 2018) to provide conditions for value functions to be Lipschitz.”
- Algorithmic Framework for Model-based Deep Reinforcement Learning with Theoretical Guarantees (2018, background): “…RL mostly focuses on either the finite-state MDPs (Jaksch et al., 2010; Bartlett & Tewari, 2009; Fruit et al., 2018; Lakshmanan et al., 2015; Hinderer, 2005; Pirotta et al., 2015; 2013), or the linear parametrization of the dynamics, policy, or value function (Abbasi-Yadkori & Szepesvári,…”
- Policy gradient in Lipschitz Markov Decision Processes (2015, methodology): “Finally, the choice of the L1Wasserstein metric rather than other sophisticated distribution distances is motivated by the fact that it has been frequently used for MDPs (Rachelson and Lagoudakis 2010; Hinderer 2005; Ferns et al. 2005).”
- Lipschitz Continuity in Model-based Reinforcement Learning (2018, unknown): “…the theory of reinforcement learning (Bertsekas, 1975; Bertsekas & Tsitsiklis, 1995; Littman & Szepesv ´ ari, 1996; M ¨ uller, 1996; Ferns et al., 2004; Hinderer, 2005; Rachelson & Lagoudakis, 2010; Szepesv´ari, 2010; Pazis & Parr, 2013; Pirotta et al., 2015; Pires & Szepesv ´ ari, 2016;…”