3250 search results - page 237 / 650 » Parameterized Learning Complexity |
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...
199
Voted
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...
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...
178
click to vote
IJCAI
2007
15 years 7 months ago
2007
A key problem in playing strategy games is learning how to allocate resources effectively. This can be a difficult task for machine learning when the connections between actions a...