Augmenting Dual Decomposition for MAP Inference
暂无分享,去创建一个
Eric P. Xing | Noah A. Smith | André F. T. Martins | Mário A. T. Figueiredo | Pedro M. Q. Aguiar | E. Xing | P. Aguiar
[1] M. Hestenes. Multiplier and gradient methods , 1969 .
[2] Yoram Singer,et al. Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.
[3] José M. Bioucas-Dias,et al. Restoration of Poissonian Images Using Alternating Direction Optimization , 2010, IEEE Transactions on Image Processing.
[4] Richard S. Zemel,et al. HOP-MAP: Efficient Message Passing with High Order Potentials , 2010, AISTATS.
[5] Tommi S. Jaakkola,et al. Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations , 2007, NIPS.
[6] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .
[7] Tommi S. Jaakkola,et al. Learning Efficiently with Approximate Inference via Dual Losses , 2010, ICML.
[8] David A. Smith,et al. Dependency Parsing by Belief Propagation , 2008, EMNLP.
[9] Thomas S. Huang,et al. Image processing , 1971 .
[10] José M. Bioucas-Dias,et al. Fast Image Recovery Using Variable Splitting and Constrained Optimization , 2009, IEEE Transactions on Image Processing.
[11] Gökhan BakIr,et al. Predicting Structured Data , 2008 .
[12] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .
[13] Nikos Komodakis,et al. MRF Optimization via Dual Decomposition: Message-Passing Revisited , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[14] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[15] Martin J. Wainwright,et al. Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes , 2010, J. Mach. Learn. Res..
[16] Eric P. Xing,et al. Turbo Parsers: Dependency Parsing by Approximate Variational Inference , 2010, EMNLP.
[17] Dimitri P. Bertsekas,et al. On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..
[18] Alexander M. Rush,et al. Dual Decomposition for Parsing with Non-Projective Head Automata , 2010, EMNLP.
[19] Martin J. Wainwright,et al. MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.
[20] M. J. D. Powell,et al. A method for nonlinear constraints in minimization problems , 1969 .
[21] Alexander M. Rush,et al. On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing , 2010, EMNLP.
[22] Stephen Gould,et al. Accelerated dual decomposition for MAP inference , 2010, ICML.
[23] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[24] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[25] Nikos Komodakis,et al. Beyond pairwise energies: Efficient optimization for higher-order MRFs , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[26] Martin J. Wainwright,et al. On the Optimality of Tree-reweighted Max-product Message-passing , 2005, UAI.
[27] R. Glowinski,et al. 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 , 1975 .
[28] B. Mercier,et al. A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .
[29] R. Glowinski,et al. Numerical Methods for Nonlinear Variational Problems , 1985 .