3643 search results - page 434 / 729 » Learning Submodular Functions |
166
click to vote
ICCBR
2007
Springer
16 years 26 days ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
196
click to vote
ICML
2004
IEEE
16 years 4 days ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
157
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
170
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing and independence testing. ...
242
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...