Sciweavers

4544 search results - page 285 / 909
» Reinforcement Learning with Time
Sort
View
137
Voted
NN
2010
Springer
125views Neural Networks» more  NN 2010»
15 years 2 months ago
Parameter-exploring policy gradients
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
Frank Sehnke, Christian Osendorfer, Thomas Rü...
156
Voted
IAT
2010
IEEE
15 years 1 months ago
Selecting Operator Queries Using Expected Myopic Gain
When its human operator cannot continuously supervise (much less teleoperate) an agent, the agent should be able to recognize its limitations and ask for help when it risks making...
Robert Cohn, Michael Maxim, Edmund H. Durfee, Sati...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 1 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
GLOBECOM
2009
IEEE
15 years 1 months ago
Cooperative Communications with Relay Selection for QoS Provisioning in Wireless Sensor Networks
Abstract--Cooperative communications have been demonstrated to be effective in combating the multiple fading effects in wireless networks, and improving the network performance in ...
Xuedong Liang, Ilangko Balasingham, Victor C. M. L...
COGSR
2011
71views more  COGSR 2011»
14 years 11 months ago
Psychological models of human and optimal performance in bandit problems
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
Michael D. Lee, Shunan Zhang, Miles Munro, Mark St...