Sciweavers

127 search results - page 3 / 26
» A linear approximation method for the Shapley value
Sort
View
NN
2010
Springer
187views Neural Networks» more  NN 2010»
14 years 4 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
60
Voted
NA
2006
70views more  NA 2006»
14 years 9 months ago
A truncated projected SVD method for linear discrete ill-posed problems
Truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. However, since the singular value decomposition of the matrix is indepen...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
92
Voted
ENTCS
2006
118views more  ENTCS 2006»
14 years 9 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
AAMAS
2007
Springer
14 years 9 months ago
Parallel Reinforcement Learning with Linear Function Approximation
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Matthew Grounds, Daniel Kudenko
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo