Learning to Prune Dependency Trees with Rethinking for Neural Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to remove noise from dependency trees are not optimal due to complexity and variability of natural language. |
| Approach: | They propose a dynamically pruned Graph Convolutional Network (DP-GCN) that prunes the dependency tree with rethinking in an end-to-end scheme. |
| Outcome: | The proposed model achieves impressive results compared to strong competitors. |
Similar Papers
Graph Convolution over Pruned Dependency Trees Improves Relation Extraction (D18-1)
Copied to clipboard
| Challenge: | Existing dependency-based models neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively. |
| Approach: | They propose an extension of graph convolutional networks that is tailored for relation extraction by pruning dependency trees too aggressively. |
| Outcome: | The proposed model outperforms existing sequence and dependency-based models on the large-scale TACRED dataset and has complementary strengths to sequence models. |
Attention Guided Graph Convolutional Networks for Relation Extraction (P19-1)
Copied to clipboard
| Challenge: | Existing approaches for selecting relevant partial dependency structures may not yield optimal results. |
| Approach: | They propose a model which directly takes full dependency trees as inputs and uses them to selectively attend to relevant sub-structures. |
| Outcome: | The proposed model can be understood as a soft-pruning approach that automatically learns how to selectively attend to the relevant sub-structures useful for the relation extraction task. |
Dependency-driven Relation Extraction with Attentive Graph Convolutional Networks (2021.acl-long)
Copied to clipboard
| Challenge: | Existing studies suffer from noise in dependency trees, which can cause confusions in relation extraction. |
| Approach: | They propose a dependency-driven approach for relation extraction with attentive graph convolutional networks . they apply an attention mechanism upon graph convolutional networks to different word dependencies . |
| Outcome: | The proposed approach outperforms previous studies on two English datasets and achieves state-of-the-art performance. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |
Rethinking Network Pruning – under the Pre-train and Fine-tune Paradigm (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing pruning results on benchmark transformers, such as BERT, are not as remarkable as those of convolutional neural networks. |
| Approach: | They propose to apply a knowledge-aware pruning process to transformer-based pre-trained language models to reduce model size and model weight. |
| Outcome: | The proposed pruning method outperforms the leading competitors with a 20-times weight/FLOPs compression and neglectable loss in prediction accuracy. |
Global Context-enhanced Graph Convolutional Networks for Document-level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to document-level relation extraction are difficult to establish direct connections between distant entity pairs. |
| Approach: | They propose a global context-enhanced Graph Convolutional Network model which captures rich global context information of entities in a document. |
| Outcome: | The proposed model captures rich global context information of entities in a document. |
DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing parsers that learn graph representations based on static graphs are error-prone and disjointed . Graph-based parser can parse sentences efficiently but suffer from error propagation . |
| Approach: | They propose a dynamic graph learning framework to learn graph representations based on a static graph constructed by an existing parser. |
| Outcome: | The proposed parser outperforms the previous parsers on the SemEval-2015 task 18 dataset in three languages. |
Graph-Based Chain-of-Thought Pruning for Reducing Redundant Reflections in Reasoning LLMs (2026.findings-acl)
Copied to clipboard
Hongyuan Yuan, Xinran He, Run Shao, Bolei He, Xianwei Xue, Mengke Chen, Qiutong Pan, Haiwei Wang, Haifeng Li
| Challenge: | Extending CoT through RL can induce undesirable thinking patterns such as overthinking . prior work has focused on inefficient reflection, which manifests in two problematic patterns: Indiscriminate Reflection and Repetitive Reflectione . |
| Approach: | They propose a graph-based approach to optimize CoT by pruning each linear CoT into a directed acyclic graph with explicit dependency edges. |
| Outcome: | The proposed approach reduces the average reasoning tokens by 42% while maintaining or improving accuracy. |
Structured Pruning for Efficient Generative Pre-trained Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Large-scale generative Pre-trained Language Models (PLMs) are limited in their deployment in real-world applications. |
| Approach: | They propose to prune the feed-forward networks of generative pre-trained language models to smaller widths without designing extra operators. |
| Outcome: | The proposed method achieves 1.51x/6.96x inference speedup on GPU/CPU with 67% size reduction. |
Aligned Weight Regularizers for Pruning Pretrained Neural Networks (2022.findings-acl)
Copied to clipboard
| Challenge: | Pruning aims to reduce the number of parameters while maintaining performance close to the original network. |
| Approach: | They propose a self-distilled pruning strategy that maximizes representational similarity between pruned and unpruned networks. |
| Outcome: | The proposed pruning strategy outperforms smaller models and outperformed smaller ones with an equal number of parameters and is competitive against (6 times) larger distilled networks. |