Scaling MPE inference for constrained continuous Markov random fields with consensus optimization

Advances in Neural Information Processing Systems

Volumn 4, Issue , 2012, Pages 2654-2662

  Bach, Stephen H ^a   Broecheler, Matthias ^b   Getoor, Lise ^a   O'Leary, Dianne P ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b Aurelius LLC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS DOMAIN; GRAPHICAL MODEL; LINEAR CONSTRAINTS; MARKOV RANDOM FIELDS; MODELING PROBLEMS; PIECEWISE-LINEAR; PROBABILISTIC GRAPHICAL MODELS; STATE OF THE ART;

ALGORITHMS; MARKOV PROCESSES; PIECEWISE LINEAR TECHNIQUES;

CONSTRAINED OPTIMIZATION;

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

References (16)

1. D. Koller and N. Friedman. Probabilistic Graphical Models: Principles and Techniques. The MIT Press, 2009.
2. M. Broecheler and L. Getoor. Computing marginal distributions over continuous Markov networks for statistical relational learning. In Advances in Neural Information Processing Systems (NIPS), 2010.
3. M. Broecheler, L. Mihalkova, and L. Getoor. Probabilistic similarity logic. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI), 2010.
4. M. Broecheler, P. Shakarian, and V. S. Subrahmanian. A scalable framework for modeling competitive diffusion in social networks. In Proceedings of the Second International Conference on Social Computing (SocialCom), 2010.
5. S. H. Bach, M. Broecheler, S. Kok, and L. Getoor. Decision-driven models with probabilistic soft logic. In NIPS Workshop on Predictive Models in Personalized Medicine, 2010.
6. B. Huang, A. Kimmig, L. Getoor, and J. Golbeck. Probabilistic soft logic for trust analysis in social networks. In International Workshop on Statistical Relational Artificial Intelligence (StaRAI), 2012.
7. B. Huang, S. H. Bach, E. Norris, J. Pujara, and L. Getoor. Social group modeling with probabilistic soft logic. In NIPS Workshop on Social Network and Social Media Analysis: Methods, Models, and Applications, 2012.
8. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers. Now Publishers, 2011.
9. A. Martins, M. Figueiredo, P. Aguiar, N. Smith, and E. Xing. An augmented Lagrangian approach to constrained MAP inference. In Proceedings of the 28th International Conference on Machine Learning (ICML), 2011.
10. O. Meshi and A. Globerson. An alternating direction method for dual MAP LP relaxation. In Proceedings of the 2011 European conference on machine learning and knowledge discovery in databases (ECML), 2011.
11. R. Glowinski and A. Marrocco. Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité, d'une classe de problèmes de Dirichlet non linéaires. Revue française d'automatique, informatique, recherche opérationnelle, 9(2):41-76, 1975.
12. D. Gabay and B. Mercier. A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers & Mathematics with Applications, 2(1):17-40, 1976.
13. D. Gabay. Applications of the method of multipliers to variational inequalities, volume 15, chapter 9, pages 299-331. Elsevier, 1983.
14. J. Eckstein and D. P. Bertsekas. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program., 55(3):293-318, 1992.
15. D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference, chapter 8, pages 219-254. MIT Press, 2011.
16. P. Ravikumar, A. Agarwal, and M. J.Wainwright. Message-passing for graph-structured linear programs: proximal methods and rounding schemes. Journal of Machine Learning Research, 11:1043-1080, 2010.