| Challenge: | A large number of parameters can cause overfitting and a long training time for neural tensor networks (NTNs). |
| Approach: | They propose two new parameter reduction techniques to reduce the number of parameters in an NTN without diminishing its expressiveness. |
| Outcome: | The proposed models learn better and faster than the original (R)NTNs. |
Similar Papers
Sliced Recurrent Neural Networks (C18-1)
Copied to clipboard
| Challenge: | Recurrent neural networks have difficulty in parallelization because of their recurrent structure. |
| Approach: | They propose sliced recurrent neural networks (SRNNs) which can be parallelized by slicing sequences into many subsequences. |
| Outcome: | The proposed recurrent neural networks perform better than standard RNNs on six large-scale sentiment analysis datasets. |
Searching for Effective Neural Extractive Summarization: What Works and What’s Next (P19-1)
Copied to clipboard
| Challenge: | Recent years have seen success in the use of deep neural networks on text summarization, but there is no clear understanding of why they perform so well or how they might be improved. |
| Approach: | They propose to use different types of model architectures to improve extractive summarization systems. |
| Outcome: | The proposed framework achieves state-of-the-art on CNN/DailyMail by a large margin based on observations and analysis. |
Unraveling Feature Extraction Mechanisms in Neural Networks (2023.emnlp-main)
Copied to clipboard
| Challenge: | Neural networks have become indispensable across a variety of natural language processing tasks. |
| Approach: | They propose a theoretical approach based on Neural Tangent Kernels to investigate neural networks' internal mechanisms. |
| Outcome: | The proposed approach can be applied to analyze language modeling tasks . it shows that the choice of activation function can affect feature extraction . |
On the Practical Computational Power of Finite Precision RNNs for Language Recognition (P18-2)
Copied to clipboard
| Challenge: | Recurrent Neural Networks (RNNs) are famously known to be Turing complete, but this relies on infinite precision in the states and unbounded computation time. |
| Approach: | They propose to use LSTM and Elman-RNN with ReLU activation to study RNNs . they show that LS and ReLU-RNns can easily implement counting behavior . |
| Outcome: | The LSTM and the Elman-RNN with ReLU activation are stronger than the RNN with squashing activation and the GRU. |
Neural Reranking for Dependency Parsing: An Evaluation (2020.acl-main)
Copied to clipboard
| Challenge: | Recent work shows that neural rerankers can improve dependency parsing results over the top k trees produced by a base parser. |
| Approach: | They propose to use a discriminative reranker to improve dependency parsing results . they propose to incorporate global information into the model to improve parse accuracies . |
| Outcome: | The proposed model outperforms existing models on English and German and Czech, and is the only one to improve on German and Chinese data. |
Augmenting Neural Networks with First-order Logic (P19-1)
Copied to clipboard
| Challenge: | Existing paradigms for training neural networks require large datasets, a paper argues . we present a framework for introducing declarative knowledge to neural networks . |
| Approach: | They propose a framework for introducing declarative knowledge to neural networks . they compile logical statements into graphs that augment a network without extra learnable parameters or manual redesign. |
| Outcome: | The proposed framework improves on three tasks, especially in low-data regimes. |
Deep Learning on Graphs for Natural Language Processing (2021.naacl-tutorials)
Copied to clipboard
| Challenge: | Graph Neural Networks (GNNs) are powerful tools for non-Euclidean data modeling and are used in many graph-related NLP tasks. |
| Approach: | This tutorial will cover applying deep learning on graph techniques to NLP using Graph Neural Networks (GNNs) Graph4NLP is the first library for researchers and practitioners for easy use of GNNs for various NLP tasks. |
| Outcome: | This tutorial will cover the latest developments in deep learning on graph techniques and their applications in various NLP tasks. |
Tensor Product Generation Networks for Deep NLP Modeling (N18-1)
Copied to clipboard
| Challenge: | Using Tensor Product Representations (TPRs) we propose a new architecture for natural language processing based on the principle that hypothesis space for learning includes network hypotheses that are independently known to be suitable for performing the target task. |
| Approach: | They propose a Tensor Product Generation Network (TPGN) which is capable of carrying out TPR computation but uses unconstrained deep learning to design its internal representations. |
| Outcome: | The proposed architecture outperforms baselines on the COCO dataset and can interpret internal representations and operations. |
Advancing Regular Language Reasoning in Linear Recurrent Neural Networks (2024.naacl-short)
Copied to clipboard
| Challenge: | Existing linear recurrent neural networks have been used for natural language and long-range modeling for decades. |
| Approach: | They propose a linear recurrent neural network with a block-diagonal transition matrix and a transition matrix for LRNNs. |
| Outcome: | The proposed model is the only one capable of performing length extrapolation on regular language tasks such as Sum, Even Pair, and Modular Arithmetic. |
Efficient and Robust Knowledge Graph Construction (2022.aacl-tutorials)
Copied to clipboard
| Challenge: | Knowledge graph construction has appealed to the NLP community but has encountered similar issues such as efficiency and robustness. |
| Approach: | They propose to introduce efficient and robust knowledge graph construction techniques and discuss their results. |
| Outcome: | This tutorial will provide an overview of the latest and ongoing techniques for efficient and robust knowledge graph construction. |