771 search results - page 35 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
119
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We consider a sequential decision problem where the rewards are generated by a piecewise-stationary distribution. However, the different reward distributions are unknown and may c...
139
click to vote
NIPS
2001
15 years 3 months ago
2001
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...
134
Voted
AAAI
2007
15 years 4 months ago
2007
In designing Markov Decision Processes (MDP), one must define the world, its dynamics, a set of actions, and a reward function. MDPs are often applied in situations where there i...
109
Voted
NIPS
2007
15 years 3 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
105
click to vote
WSC
2008
15 years 4 months ago
2008
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...