1450 search results - page 6 / 290 » Complexity of Inference in Graphical Models |
AAAI
2007
13 years 10 months ago
2007
AAAI
2012
11 years 10 months ago
2012
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
JMLR
2012
11 years 10 months ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
AAAI
2010
13 years 9 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...