2750 search results - page 314 / 550 » The complexity of learning SUBSEQ(A) |
164
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
158
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
199
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
172
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
145
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...