Learning message-passing inference machines for structured prediction

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2011, Pages 2737-2744

  Ross, Stéphane ^a   Munoz, Daniel ^a   Hebert, Martial ^a   Bagnell, J Andrew ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; FORECASTING; GRAPHIC METHODS; SPEECH RECOGNITION;

APPROXIMATE INFERENCE; BELIEF PROPAGATION; GRAPHICAL MODEL; INFERENCE MACHINE; LABEL DISTRIBUTION; LABELED GRAPHS; MESSAGE PASSING ALGORITHM; STRUCTURED PREDICTION;

MESSAGE PASSING;

EID: 80052872903     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995724     Document Type: Conference Paper

References (23)

1. Y. Bengio. Learning deep architectures for AI. Foundations and Trends in Machine Learning, 2(1), 2009.
2. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. T-PAMI, 23(1), 1999.
3. L. Csato, M. Opper, and O. Winther. Tap gibbs free energy, belief propagation and sparsity. In NIPS, 2001.
4. H. Daumé III, J. Langford, and D. Marcu. Search-based structured prediction. MLJ, 75(3), 2009.
5. G. Elidan, I. McGraw, and D. Koller. Residual belief propagation: Informed scheduling for asynchronous message passing. In UAI, 2006.
6. T. Finley and T. Joachims. Training structural svms when exact inference is intractable. In ICML, 2008.
7. D. Hoiem, A. A. Efros, and M. Hebert. Recovering surface layout from an image. IJCV, 75(1), 2007.
8. P. Kohli, L. Ladicky, and P. H. Torr. Robust higher order potentials for enforcing label consistency. IJCV, 82(3), 2009.
9. A. Kulesza and F. Pereira. Structured learning with approximate inference. In NIPS, 2008.
10. S. Kumar, J. August, and M. Hebert. Exploiting inference for approximate parameter learning in discriminative fields: An empirical study. In EMMCVPR, 2005.
11. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, 2001.
12. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. IEEE, 86(11), 1998.
13. D. Munoz, J. A. Bagnell, and M. Hebert. Stacked hierarchical labeling. In ECCV, 2010.
14. D. Munoz, J. A. Bagnell, N. Vandapel, and M. Hebert. Contextual classification with functional max-margin markov networks. In CVPR, 2009.
15. M. Opper and D. Saad. Advanced Mean Field methods - Theory and Practice. MIT Press, 2000.
16. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., 1988.
17. S. Ross and J. A. Bagnell. Efficient reductions for imitation learning. In AISTATS, 2010.
18. S. Ross, G. J. Gordon, and J. A. Bagnell. No-Regret Reductions for Imitation Learning and Structured Prediction. In AISTATS, 2011.
19. D. Roth, K. Small, and I. Titove. Sequential learning of classifiers for structured prediction problems. In AISTATS, 2009.
20. B. Taskar, C. Guestrin, and D. Koller. Max-margin markov networks. In NIPS, 2003.
21. Z. Tu and X. Bai. Auto-context and its application to high-level vision tasks and 3d brain image segmentation. T-PAMI, 32(5), 2009.
22. M. J. Wainwright. Estimating the "wrong" graphical model: Benefits in the computation-limited setting. JMLR, 7(11), 2006.
23. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree-based reparameterization for approximate estimation on loopy graphs. In NIPS, 2001.