Sciweavers

157 search results - page 6 / 32
» On Bayesian bounds
Sort
View
ALT
2010
Springer
13 years 9 months ago
Bayesian Active Learning Using Arbitrary Binary Valued Queries
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
Liu Yang, Steve Hanneke, Jaime G. Carbonell
JMLR
2002
74views more  JMLR 2002»
13 years 7 months ago
The Representational Power of Discrete Bayesian Networks
One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper,...
Charles X. Ling, Huajie Zhang
CVPR
2000
IEEE
13 years 11 months ago
Likelihood Functions and Confidence Bounds for Total-Least-Squares Problems
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...
Oscar Nestares, David J. Fleet, David J. Heeger
ICML
2008
IEEE
14 years 8 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
TSP
2010
13 years 2 months ago
Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
Nonparametric Bayesian methods are employed to constitute a mixture of low-rank Gaussians, for data x RN that are of high dimension N but are constrained to reside in a low-dimen...
Minhua Chen, Jorge Silva, John William Paisley, Ch...