4903 search results - page 597 / 981 » The Set Covering Machine |
153
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We examine the problem of evaluating a policy in the contextual bandit setting using only observations collected during the execution of another policy. We show that policy evalua...
167
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
185
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
172
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
180
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...