Sciweavers

845 search results - page 11 / 169
» Parallel Exact Inference
Sort
View
JMLR
2012
11 years 10 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
ICML
2005
IEEE
14 years 8 months ago
Tempering for Bayesian C&RT
This paper concerns the experimental assessment of tempering as a technique for improving Bayesian inference for C&RT models. Full Bayesian inference requires the computation ...
Nicos Angelopoulos, James Cussens
ICML
1999
IEEE
14 years 8 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
AAAI
2006
13 years 9 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
AI
2006
Springer
13 years 11 months ago
An Improved LAZY-AR Approach to Bayesian Network Inference
We propose LAZY arc-reversal with variable elimination (LAZY-ARVE) as a new approach to probabilistic inference in Bayesian networks (BNs). LAZY-ARVE is an improvement upon LAZY ar...
Cory J. Butz, Shan Hua