Fast exact inference for recursive cardinality models

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 825-834

  Tarlow, Daniel ^a   Swersky, Kevin ^a   Zemel, Richard S ^a   Adams, Ryan P ^b   Frey, Brendan J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY VARIABLES; BELIEF PROPAGATION; EFFICIENT COMPUTATION; HIGH-ORDER POTENTIALS; MACHINE LEARNING COMMUNITIES; MARGINAL PROBABILITY; MAXIMUM A POSTERIORI; SIMPLE ALGORITHM;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FORESTRY;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; MATHEMATICS; TREES;

EID: 84886079293     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Barlow, R. E., &Heidtmann, K. D. (1984). Computing k-out-of-n system reliability. IEEE Transactions on Reliability, 33 , 322-323.
2. Belfore, L. (1995). An O(n) log2(n) algorithm for computing the reliability of k-out-of-n:G and kto-l-out-of-n:G systems. IEEE Transactions on Reliability, 44 (1).
3. Chen, S. X., &Liu, J. S. (1997). Statistical applications of the Poisson-Binomial and conditional Bernoulli distributions. Statistica Sinica, 7 (4).
4. de Salvo Braz, R., Amir, E., &Roth, D. (2005). Lifted first-order probabilistic inference. In In proceedings of ijcai-05, 19th international joint conference on artificial intelligence (pp. 1319-1325). Morgan Kaufmann.
5. Dietterich, T. G., Lathrop, R. H., Lozano-Perez, T., &Pharmaceutical, A. (1997). Solving the multipleinstance problem with axis-parallel rectangles. Artificial Intelligence, 89 , 31-71.
6. Felzenszwalb, P. F., &Huttenlocher, D. P. (2004). Efficient belief propagation for early vision. In CVPR (pp. 261-268).
7. Fernandez, M., &Williams, S. (2010). Closedform expression for the poisson-binomial probability density function. IEEE Transactions on Aerospace Electronic Systems, 46 , 803-81.
8. Fisher, M. E. (1961, Dec). Statistical mechanics of dimers on a plane lattice. Phys. Rev., 124 , 1664-1672. Available from http://link.aps.org/ doi/10.1103/PhysRev.124.1664
9. Gail, M. H., Lubin, J. H., &Rubinstein, L. V. (1981). Likelihood calculations for matched case-control studies and survival studies with tied death times. Biometrika. 9+69+6-
10. Gallager, R. (1963). Low-density parity-check codes. MIT Press.
11. Ganchev, K., Gra̧ca, J., Gillenwater, J., &Taskar, B. (2010). Posterior regularization for structured latent variable models. Journal of Machine Learning Research, 11 , 2001-2049.
12. Gehler, P., &Chapelle, O. (2007, March). Deterministic annealing for multiple-instance learning. In Meila, M., &X. Shen (Eds.), ICML (p. 123-130).
13. Gould, S. (2011). Max-margin learning for lower linear envelope potentials in binary markov random fields. In ICML.
14. Gupta, R., Diwan, A., &Sarawagi, S. (2007). Efficient inference with cardinality-based clique potentials. In ICML (Vol. 227, p. 329-336)
15. Hong, Y. (2011). On computing the distribution function for the sum of independent and nonidentical random indicators.
16. Huang, B., &Jebara, T. (2007). Loopy belief propagation for bipartite maximum weight b-matching. In AISTATS.
17. Kohli, P., Ladicky, L., &Torr, P. H. S. (2009). Robust higher order potentials for enforcing label consistency. International Journal of Computer Vision, 82 (3), 302-324.
18. Marlin, B., Swersky, K., Chen, B., &Freitas, N. de. (2010). Inductive principles for restricted boltzmann machine learning. In AISTATS.
19. Mezuman, E., &Weiss, Y. (2012). Globally optimizing graph partitioning problems using message passing. In AISTATS.
20. Milch, B., Zettlemoyer, L. S., Kersting, K., Haimes, M., &Kaelbling, L. P. (2008). Lifted probabilistic inference with counting formulas. In D. Fox &C. P. Gomes (Eds.), Aaai (p. 1062-1068). AAAI Press.
21. Potetz, B., &Lee, T. S. (2008, Oct). Efficient belief propagation for higher order cliques using linear constraint nodes. Computer Vision and Image Understanding, 112 (1), 39-54.
22. Ramalingham, S., Kohli, P., Alahari, K., &Torr, P. (2008). Exact inference in multi-label CRFs with higher order cliques. In CVPR.
23. Regin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In AAAI/IAAI (p. 209-215)
24. Rother, C., Kohli, P., Feng, W., &Jia, J. (2009). Minimizing sparse higher order energy functions of discrete variables. In CVPR (p. 1382-1389).
25. Stobbe, P., &Krause, A. (2010). Efficient minimization of decomposable submodular functions. In NIPS.
26. Tarlow, D., Givoni, I., &Zemel, R. (2010). HOPMAP: Efficient message passing for high order potentials. In AISTATS.
27. Vicente, S., Kolmogorov, V., &Rother, C. (2009). Joint optimization of segmentation and appearance models. In ICCV.
28. Zhao, P., Rocha, G., &Yu, B. (2006). Grouped and hierarchical model selection through composite absolute penalties. Department of Statistics, UC Berkeley, Tech. Rep, 703 .