3837 search results - page 95 / 768 » Learning Approximate Consistencies |
130
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
128
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
125
click to vote
JCSS
2007
15 years 4 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
114
Voted
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
140
click to vote
ECTEL
2006
Springer
15 years 7 months ago
2006
Springer
Current systems used in education follow a consistent design pattern, one that is not supportive of lifelong learning or personalization, is asymmetric in terms of user capability,...