716 search results - page 101 / 144 » Optimizing Sorting with Machine Learning Algorithms |
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
121
click to vote
ECML
2006
Springer
15 years 3 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
102
click to vote
EWRL
2008
15 years 3 months ago
2008
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...
129
click to vote
ICONIP
2007
15 years 3 months ago
2007
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
108
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...