Sciweavers

157 search results - page 10 / 32
» On Bayesian bounds
Sort
View
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
14 years 4 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa
FOCS
2008
IEEE
14 years 4 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim
CORR
2007
Springer
169views Education» more  CORR 2007»
13 years 9 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 10 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
CVPR
2008
IEEE
14 years 11 months ago
Incremental learning of nonparametric Bayesian mixture models
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group b...
Ryan Gomes, Max Welling, Pietro Perona