1454 search results - page 200 / 291 » Learning with cost intervals |
149
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
150
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
151
click to vote
NIPS
2007
15 years 6 months ago
2007
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
144
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
140
click to vote
KCAP
2003
ACM
15 years 10 months ago
2003
ACM
Acquiring knowledge has long been the major bottleneck preventing the rapid spread of AI systems. Manual approaches are slow and costly. Machine-learning approaches have limitatio...