3694 search results - page 49 / 739 » Stochastic complexity in learning |
AAAI
2007
13 years 10 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
We present an artificial neural network used to learn online complex temporal sequences of gestures to a robot. The system is based on a simple temporal sequences learning architec...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
JIRS
2000
13 years 7 months ago
2000
Abstract. Autonomous learning systems of significant complexity often consist of several interacting modules or agents. These modules collaborate to produce a system which, when vi...