Dual Decomposition Inference for Graphical Models over Strings
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Transferring Neural Potentials For High Order Dependency Parsing
High order dependency parsing leverages high order features such as siblings or grandchildren to improve state of the art accuracy of current first order dependency parsers. The present paper uses biaffine scores to prov…
ARCDependency ParsingContinuous Inference in Graphical Models with Polynomial Energies
In this paper, we tackle the problem of performing inference in graphical models whose energy is a polynomial function of continuous variables. Our energy minimization method follows a dual decomposition approach, where …
DiversityDual Decomposition from the Perspective of Relax, Compensate and then Recover
Relax, Compensate and then Recover (RCR) is a paradigm for approximate inference in probabilistic graphical models that has previously provided theoretical and practical insights on iterative belief propagation and some …
Reference String Extraction Using Line-Based Conditional Random Fields
The extraction of individual reference strings from the reference section of scientific publications is an important step in the citation extraction pipeline. Current approaches divide this task into two steps by first d…
A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing
Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tu…
Combinatorial Optimization