2750 search results - page 142 / 550 » The complexity of learning SUBSEQ(A) |
176
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
148
click to vote
IUI
1999
ACM
15 years 10 months ago
1999
ACM
Although Programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-speci...
198
click to vote
DAGM
2008
Springer
15 years 8 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
190
click to vote
EWRL
2008
15 years 8 months ago
2008
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
129
click to vote
IJCAI
2007
15 years 7 months ago
2007
Although necessary, learning to discover new solutions is often long and difficult, even for supposedly simple tasks such as counting. On the other hand, learning by imitation pr...