Variational probabilistic inference and the QMR-DT network

被引:73
作者
Jaakkola, TS
Jordan, MI
机构
[1] MIT, Artificial Intelligence Lab, Cambridge, MA 02139 USA
[2] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA
[3] Univ Calif Berkeley, Dept Stat, Berkeley, CA 94720 USA
关键词
D O I
10.1613/jair.583
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We describe a variational approximation method for efficient inference in large-scale probabilistic models. Variational methods are deterministic procedures that provide approximations to marginal and conditional probabilities of interest. They provide alternatives to approximate inference methods based on stochastic sampling or search. We describe a variational approach to the problem of diagnostic inference in the "Quick Medical Reference" (QMR) network. The QMR network is a large-scale probabilistic graphical model built on statistical and expert knowledge. Exact probabilistic inference is infeasible in this model for all but a small set of cases. We evaluate our variational inference algorithm on a large set of diagnostic test cases, comparing the algorithm to a state-of-the-art stochastic sampling method.
引用
收藏
页码:291 / 322
页数:32
相关论文
共 33 条
[1]  
[Anonymous], 1998, LEARNING GRAPHICAL M
[2]  
COOPER G, 1985, THESIS STANFORD STAN
[3]   THE COMPUTATIONAL-COMPLEXITY OF PROBABILISTIC INFERENCE USING BAYESIAN BELIEF NETWORKS [J].
COOPER, GF .
ARTIFICIAL INTELLIGENCE, 1990, 42 (2-3) :393-405
[4]   APPROXIMATING PROBABILISTIC INFERENCE IN BAYESIAN BELIEF NETWORKS IS NP-HARD [J].
DAGUM, P ;
LUBY, M .
ARTIFICIAL INTELLIGENCE, 1993, 60 (01) :141-153
[5]   A BAYESIAN-ANALYSIS OF SIMULATION ALGORITHMS FOR INFERENCE IN BELIEF NETWORKS [J].
DAGUM, P ;
HORVITZ, E .
NETWORKS, 1993, 23 (05) :499-516
[6]  
DAGUM P, 1992, P 8 ANN C UNC ART IN
[7]  
DAMBROSIO B, 1993, P 9 C UNC ART INT
[8]  
DAMBROSIO B, 1994, P 10 C UNC ART INT
[9]  
DECHTER R, 1997, P 15 INT JOINT C ART
[10]  
Dechter Rina, 1998, LEARNING GRAPHICAL M