Fast parallel and adaptive updates for dual-decomposition solvers

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1076-1082

  Sümer, Özgür ^a   Acar, Umut A ^b   Ihler, Alexander T ^c   Mettu, Ramgopal R ^d  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^c Ringgold Standard Institution Informatics   (United States)

^d University of Massachusetts   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE UPDATE; APPROXIMATE INFERENCE; CLUSTER TREE; COMPLEX MODEL; CONVERGENCE TIME; EXACT INFERENCE; EXACT SOLUTION; GRAPHICAL MODEL; MINIMUM ENERGY; PARALLEL SOLVER; SPEED-UPS; STEREO MATCHING; SUB-PROBLEMS; SYNTHETIC INPUT; UPPER AND LOWER BOUNDS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA STRUCTURES; PLANT EXTRACTS; TREES (MATHEMATICS);

CONVERGENCE OF NUMERICAL METHODS;

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

References (26)

1. Acar, U. A.; Bleiloch, G.; Harper, R.; Vittes, J.; and Woo, M. 2004. Dynamizing static algorithms with applications to dynamic trees and history independence. In ACM-SIAM Symposium on Discrite Algorithms (SODA), 531-540.
2. Acar, U.; Ihler, A. T.; Mettu, R. R.; and Sümer, O. 2007. Adaptive Bayesian inference. In Advances in Neural Information Processing Systems (NIPS). MIT Press.
3. Acar, U. A.; Ihler, A. T.; Mettu, R. R.; and Sümer, O. 2008. Adaptive Bayesian inference in general graphs. In Proceedings of the 24th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 1-8.
4. Acar, U. A.; Ihler, A. T.; Mettu, R. R.; and Sümer, O. 2009a. Adaptive updates for maintaining MAP configurations with applications to bioinformatics. In Proceedings of the IEEE Workshop on Statistical Signal Processing, 413-416.
5. Acar, U. A.; Blelloch, G. E.; Blume, M.; Harper, R.; and Tangwongsan, K. 2009b. An experimental analysis of self-adjusting computation. ACM Transactions on Programming Languages and Systems (TOPLAS) 32(1):3:1-3:53.
6. Acar, U. A.; Blelloch, G. E.; and Vittes, J. L. 2005. An experimental analysis of change propagation in dynamic trees. In Workshop on Algorithm Engineering and Experimentation.
7. Achanta, R.; Shaji, A.; Smith, K.; Lucchi, A.; Fua, P.; and Süsstrunk, S. 2010. SLIC Superpixels. Technical report, EPFL, École Polytechnique Fédérale De Lausanne.
8. Globerson, A., and Jaakkola, T. 2007. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In Advances in Neural Information Processing Systems (NIPS).
9. Hammer, M. A.; Acar, U. A.; and Chen, Y. 2009. CEAL: a C-based language for self-adjusting computation. In Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation.
10. Hong, L., and Chen, G. 2004. Segment-based stereo matching using graph cuts. In Computer Vision and Pattern Recognition (CVPR), 74-81.
11. Johnson, J. K.; Malioutov, D. M.; and Willsky, A. S. 2007. Lagrangian relaxation for MAP estimation in graphical models. In In Allerton Conference Communication, Control and Computing.
12. Jojic, V.; Gould, S.; and Koller, D. 2010. Fast and smooth: Accelerated dual decomposition for MAP inference. In Proceedings of International Conference on Machine Learning (ICML).
13. Komodakis, N.; Paragios, N.; and Tziritas, G. 2007. MRF optimization via dual decomposition: Message-passing revisited. In International Conference on Computer Vision (ICCV).
14. Leiserson, C. E. 2009. The cilk++ concurrency platform. In Proceedings of the 46th Annual Design Automation Conference (DAC), 522-527. ACM.
15. Ley-Wild, R.; Fluet, M.; and Acar, U. A. 2008. Compiling self-adjusting programs with continuations. In Pro-ceedings of the International Conference on Functional Programming.
16. Namasivayam, V. K.; Pathak, A.; and Prasanna, V. K. 2006. Scalable parallel implementation of bayesian network to junction tree conversion for exact inference. In Information Retrieval: Data Structures and Algorithms, 167-176. Prentice-Hall PTR.
17. Pennock, D. M. 1998. Logarithmic time parallel Bayesian inference. In Proceedings 14th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 431-438.
18. Reif, J. H., and Tate, S. R. 1994. Dynamic parallel tree contraction. In Proceedings 5th Annual ACM Symp. on Parallel Algorithms and Architectures, 114-121.
19. Scharstein, D., and Szeliski, R. 2001. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47:7-42.
20. Scharstein, D. 2003. High-accuracy stereo depth maps using structured light. In Computer Vision and Pattern Recognition (CVPR), 195-202.
21. Szeliski, R.; Zabih, R.; Scharstein, D.; Veksler, O.; Kolmogorov, V.; Agarwala, A.; Tappen, M.; and Rother, C. 2008. A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) 30:1068-1080. (Pubitemid 351650109)
22. Trinh, H. 2008. Efficient stereo algorithm using multiscale belief propagation on segmented images. In British Machine Vision Conference (BMVC).
23. Veksler, O. 2005. Stereo correspondence by dynamic programming on a tree. In Computer Vision and Pattern Recognition (CVPR), CVPR '05, 384-390. IEEE Computer Society.
24. Wainwright, M.; Jaakkola, T.; and Willsky, A. 2005. MAP estimation via agreement on (hyper)trees: message-passing and linear programming approaches. IEEE Transactions on Information Theory 51(11):3697-3717. (Pubitemid 41622574)
25. Xia, Y., and Prasanna, V. K. 2008. Junction tree decomposition for parallel exact inference. In IEEE International Parallel and Distributed Preocessing Symposium, 1-12.
26. Yarkony, J.; Fowlkes, C.; and Ihler, A. 2010. Covering trees and lower-bounds on quadratic assignment. In Computer Vision and Pattern Recognition (CVPR), 887-894.