The ability to capture complex linguistic structures and long-term dependencies among words in the passage is essential for many natural language understanding tasks. In relation extraction , dependency trees that contain rich syntactic clues have been widely used to help capture long-term dependencies in text . Graph neural networks (GNNs), one of the means to encode dependency graphs, has been shown effective in several prior works. However, relatively little attention has been paid to the receptive fields of GNNs, which can be crucial in tasks with extremely long text that go beyond single sentences and require discourse analysis . In this work, we leverage the idea of graph pooling and propose the Mirror Graph Convolution Network (MrGCN) , a GNN model with  pooling-unpooling structures tailored to relation extraction . The pooling branch reduces the graph size and enables the GCN to obtain larger receptive fields within less layers; the unpooling branch restores the pooled graph to its original resolution such that token-level relation extraction can be performed . Experiments on two  datasets demonstrate the effectiveness of our method, showing significant improvements over previous results .
The ability to capture complex linguistic structures and long-term dependencies among words in the passage is essential for relation extraction (RE) tasks . Graph neural networks (GNNs), one of the means to encode dependency graphs, have been shown to be effective in prior works. However, relatively little attention has been paid to receptive fields of GNNs, which can be crucial for tasks with extremely long text that requires discourse understanding . In this work, we leverage the idea of graph pooling and propose the Mirror Graph Convolution Network , a GNN model with a pooling-unpooling structure tailored to RE tasks . The pooling branch reduces the graph size and enables the GNN to obtain larger receptive fields within fewer layers; the unpooling branch restores the pooled graph to its original resolution for token-level RE tasks . Experiments on two discourse-level relation extraction datasets demonstrate the effectiveness of our method, showing significant improvements over prior methods especially when modeling long-term dependencies is necessary. Moreover, we propose Clause Matching (CM), a novel graph pooling method that merges nodes based on dependency relations in graph. CM can largely reduce the graph size while retaining the main semantics of the input text .
R
many natural language understanding tasks. In relation extraction , dependency trees that contain rich syntactic clues have been widely used to help capture long-term dependencies in text
relation extraction (RE) tasks
R
has been shown effective in several
have been shown to be effective in
D
the
R
in
for
R
go beyond single sentences and require discourse analysis
requires discourse understanding
D
(MrGCN)
A
a
R
structures tailored to relation extraction
structure tailored to RE tasks
R
GCN
GNN
R
less
fewer
R
such that
for
R
relation extraction can be performed
RE tasks
A
discourse-level relation extraction
R
previous results
prior methods especially when modeling long-term dependencies is necessary. Moreover, we propose Clause Matching (CM), a novel graph pooling method that merges nodes based on dependency relations in graph. CM can largely reduce the graph size while retaining the main semantics of the input text