Dual Decomposition for Natural Language Processing
暂无分享,去创建一个
[1] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[2] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.
[3] Alexander M. Rush,et al. Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation , 2011, ACL.
[4] Alexander M. Rush,et al. On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing , 2010, EMNLP.
[5] Tommi S. Jaakkola,et al. Tightening LP Relaxations for MAP using Message Passing , 2008, UAI.
[6] Christopher Raphael,et al. Coarse-to-Fine Dynamic Programming , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[7] John DeNero,et al. Model-Based Aligner Combination Using Dual Decomposition , 2011, ACL.
[8] Asuman E. Ozdaglar,et al. Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods , 2008, SIAM J. Optim..
[9] Michael Collins,et al. Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation , 2011, EMNLP.
[10] David A. Smith,et al. Dependency Parsing by Belief Propagation , 2008, EMNLP.
[11] Alexander M. Rush,et al. Dual Decomposition for Parsing with Non-Projective Head Automata , 2010, EMNLP.
[12] Dan Klein,et al. Factored A* Search for Models over Sequences and Trees , 2003, IJCAI.
[13] Nikos Komodakis,et al. MRF Energy Minimization and Beyond via Dual Decomposition , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[14] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[15] Claude Lemaréchal,et al. Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.