9886 search results - page 314 / 1978 » Learning Compressible Models |
134
click to vote
ALT
2006
Springer
16 years 1 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...
148
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
157
click to vote
AMR
2006
Springer
15 years 8 months ago
2006
Springer
This work presents a discriminative model for the retrieval of pictures from text queries. The core idea of this approach is to minimize a loss directly related to the retrieval pe...
134
click to vote
ICML
1998
IEEE
16 years 5 months ago
1998
IEEE
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...