377 search results - page 26 / 76 » A Value Theory of Meta-Learning Algorithms |
109
click to vote
WWW
2005
ACM
16 years 14 days ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
101
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
105
click to vote
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper, we present a novel algorithm for incremental principal component analysis. Based on the LargestEigenvalue-Theory, i.e. the eigenvector associated with the largest ei...