jmlr jmlr2009 jmlr2009-53 jmlr2009-53-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Shaowei Lin, Bernd Sturmfels, Zhiqiang Xu
Abstract: Inference in Bayesian statistics involves the evaluation of marginal likelihood integrals. We present algebraic algorithms for computing such integrals exactly for discrete data of small sample size. Our methods apply to both uniform priors and Dirichlet priors. The underlying statistical models are mixtures of independent distributions, or, in geometric language, secant varieties of SegreVeronese varieties. Keywords: marginal likelihood, exact integration, mixture of independence model, computational algebra
D.M. Chickering and D. Heckerman. Efficient approximations for the marginal likelihood of bayesian networks with hidden variables. Machine Learning, 29:181–212, 1997. Microsoft Research Report, MSR-TR-96-08. 1630 M ARGINAL L IKELIHOOD I NTEGRALS D. Cox, J. Little, and D. O’Shea. Using Algebraic Geometry. Springer-Verlag, 2 edition, 2005. M. Drton. Likelihood ratio tests and singularities. Ann. Statist., 37(2):979–1012, 2009. M. Drton, B. Sturmfels, and S. Sullivant. Lectures on Algebraic Statistics, volume 39 of Oberwolfach Seminars. Birkh¨ user, Basel, 2009. a M. Evans, Z. Gilula, and I. Guttman. Latent class analysis of two-way contingency tables by bayesian methods. Biometrika, 76:557–563, 1989. S. Feinberg, P. Hersh, A. Rinaldo, and Y. Zhou. Maximum likelihood estimation in latent class models for contingency table data. arXiv:0709.3535, 2007. W. Fulton. Introduction to Toric Varieties. Princeton Univ. Press, 1993. S. Gao, G. Jiang, and M. Zhu. Solving the 100 swiss francs problem. arXiv:0809.4627, 2008. D. Geiger and D. Rusakov. Asymptotic model selection for naive bayesian networks. Journal of Machine Learning Research, 6:1–35, 2005. S. Hosten, A. Khetan, and B. Sturmfels. Solving the likelihood equations. Foundations of Compu¸ tational Mathematics, 5:389–407, 2005. L. Pachter and B. Sturmfels. Algebraic Statistics for Computational Biology. Cambridge University Press, 2005. R. Stanley. A zonotope associated with graphical degree sequences. In P. Gritzmann and B. Sturmfels, editors, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, volume 4 of DIMACS Series in Discrete Mathematics, pages 555–570. Amer. Math. Soc., 1991. B. Sturmfels. Open problems in algebraic statistics. In M. Putinar and S. Sullivant, editors, Emerging Applications of Algebraic Geometry, volume 149 of Volumes in Mathematics and its Applications, pages 351–364. I.M.A., 2008. S. Watanabe. Algebraic analysis for nonidentifiable learning machines. Neural Computation, 13: 899–933, 2001. S. Watanabe and K. Yamazaki. Singularities in mixture models and upper bounds of stochastic complexity. International Journal of Neural Networks, 16:1029–1038, 2003. S. Watanabe and K. Yamazaki. Newton diagram and stochastic complexity in mixture of binomial distributions. In Algorithmic Learning Theorem, volume 3244 of Lecture Notes in Computer Science, pages 350–364. Springer, 2004. G. Ziegler. Lectures on Polytopes. Springer-Verlag, 1995. 1631