13 search results - page 1 / 3 » Minimal Sufficient Explanations for Factored Markov Decision... |
81
Voted
AIPS
2009
15 years 19 hour ago
2009
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...
91
Voted
AAAI
1997
15 years 7 days ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
86
Voted
ICMLA
2009
14 years 8 months ago
2009
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
AUTOMATICA
2006
14 years 11 months ago
2006
While risk-sensitive (RS) approaches for designing plans of total productive maintenance are critical in manufacturing systems, there is little in the literature by way of theoret...
NIPS
2008
15 years 10 days ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...