686 search results - page 5 / 138 » Minimax Probability Machine |
CVPR
2000
IEEE
14 years 11 months ago
2000
IEEE
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
COLT
2007
Springer
14 years 3 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
ALT
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
JMLR
2010
13 years 3 months ago
2010
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
IJAR
2010
13 years 7 months ago
2010
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...