1455 search results - page 88 / 291 » Exploiting Myopic Learning |
140
click to vote
COLT
1993
Springer
15 years 7 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
132
click to vote
ECML
1991
Springer
15 years 6 months ago
1991
Springer
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
127
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
From a conceptual point of view, belief revision and learning are quite similar. Both methods change the belief state of an intelligent agent by processing incoming information. Ho...
165
click to vote
ETVC
2008
15 years 4 months ago
2008
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
144
click to vote
IJCAI
2001
15 years 4 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...