3643 search results - page 250 / 729 » Learning Submodular Functions |
158
click to vote
AIEDAM
2004
15 years 6 months ago
2004
: This paper reports on preliminary results of an explorative study of a protocol analysis of team learning while designing using in-situ data. Two measurement-based frameworks are...
165
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
188
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
166
click to vote
CIKM
2000
Springer
15 years 11 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
176
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...