495 search results - page 57 / 99 » Approximation algorithms for budgeted learning problems |
78
Voted
AAMAS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...
76
Voted
TIP
2008
14 years 9 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
108
click to vote
JMLR
2010
14 years 4 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
97
Voted
KDD
2012
ACM
13 years 4 days ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
124
click to vote
ECML
2006
Springer
15 years 1 months ago
2006
Springer
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...