908 search results - page 25 / 182 » Stochastic Finite Learning |
ICCBR
2010
Springer
14 years 19 days ago
2010
Springer
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
WIA
1999
Springer
14 years 29 days ago
1999
Springer
Abstract. In computer science methods to aid learning are very imporcause abstract models are used frequently. For this conventional teaching methods do not suffice. We have develo...
ALT
2009
Springer
14 years 5 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...