Papers with DAGs
The problem with probabilistic DAG automata for semantic graphs (N19-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) annotations are directed acyclic graphs, but most probabilistic models view them as strings or trees. |
| Approach: | They show that some DAG automata cannot be made into useful probabilistic models by assigning weights to transitions. |
| Outcome: | The proposed model can't be made into useful probabilistic models by assigning weights to transitions . the proposed model is not feasible for all variants, but it is problematic for planar variants if they are not rooted . |
GRAFT: A Graph-based Flow-aware Agentic Framework for Document-level Machine Translation (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Existing Document-level machine translation systems struggle to handle discourse-level phenomena such as pronoun resolution, lexical cohesion, and ellipsis. |
| Approach: | They propose a graph-based document-level machine translation framework that leverages Large Language Models to model translation flow and discourse structure. |
| Outcome: | The proposed framework outperforms commercial and closed systems in eight languages and six domains. |
N-ary Relation Extraction using Graph-State LSTM (D18-1)
Copied to clipboard
| Challenge: | Existing methods for cross-sentence relation extraction split the input graph into two DAGs, but important information can be lost in the splitting procedure. |
| Approach: | They propose a graph-state LSTM model which uses a parallel state to model each word, recurrently enriching state values via message passing. |
| Outcome: | The proposed model keeps the original graph structure, and speeds up computation by allowing more parallelization. |
Semantic graph parsing with recurrent neural network DAG grammars (D19-1)
Copied to clipboard
| Challenge: | Semantic parsing is the task of mapping natural language to machine interpretable meaning representations. |
| Approach: | They propose a graph-aware sequence model that generates only well-formed graphs . their model is based on a multilingual semantic graphbank . |
| Outcome: | The proposed model yields competitive results in English and establishes the first results for German, Italian and Dutch. |
Accurate polyglot semantic parsing with DAG grammars (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Semantic parsers treat graphs as strings or trees, but there is no guarantee that the output is a well-formed graph. |
| Approach: | They propose a graph-aware sequence model that utilizes a DAG grammar to guide graph generation. |
| Outcome: | The proposed model outperforms string-based and DAG-grammar models by a large margin and can guarantee the well-formed graphs. |
Enhanced Data Synthesis for LLM through Reasoning Structures Generated by Hierarchical GFlowNet (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to optimize instruction-response pairs lack a systematic design for the underlying reasoning structure. |
| Approach: | They propose a Reasoning Structure driven data Synthesis method that leverages a coarse-to-fine directed acyclic graph to construct reasoning structures efficiently. |
| Outcome: | The proposed method outperforms existing methods in 48.50%, 84.00%, 79.90% of the synthetic datasets trained on the proposed model. |