Sciweavers

157 search results - page 3 / 32
» On Bayesian bounds
Sort
View
AAAI
2008
13 years 8 months ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown
CORR
2008
Springer
65views Education» more  CORR 2008»
13 years 5 months ago
A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...
Zvika Ben-Haim, Yonina C. Eldar
ECAI
2010
Springer
13 years 5 months ago
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
Johan Kwisthout, Hans L. Bodlaender, Linda C. van ...
NIPS
2008
13 years 7 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould
CORR
2004
Springer
88views Education» more  CORR 2004»
13 years 5 months ago
A Note on the PAC Bayesian Theorem
We prove general exponential moment inequalities for averages of [0,1]valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on t...
Andreas Maurer