REVIEW 1 cited by
No Need to Pay Attention: Simple Recurrent Neural Networks Work! (for Answering "Simple" Questions)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
First-order factoid question answering assumes that the question can be answered by a single fact in a knowledge base (KB). While this does not seem like a challenging task, many recent attempts that apply either complex linguistic reasoning or deep neural networks achieve 65%-76% accuracy on benchmark sets. Our approach formulates the task as two machine learning problems: detecting the entities in the question, and classifying the question as one of the relation types in the KB. We train a recurrent neural network to solve each problem. On the SimpleQuestions dataset, our approach yields substantial improvements over previously published results --- even neural networks based on much more complex architectures. The simplicity of our approach also has practical advantages, such as efficiency and modularity, that are valuable especially in an industry setting. In fact, we present a preliminary analysis of the performance of our model on real queries from Comcast's X1 entertainment platform with millions of users every day.
Forward citations
Cited by 1 Pith paper
-
Harnessing RLHF for Robust Unanswerability Recognition and Trustworthy Response Generation in LLMs
SALU, a multi-task fine-tuning and confidence-guided RLHF method, reduces hallucinated answers on unanswerable Chinese CIR questions to 1.3 percent on the authors' private dataset.
Discussion (0). Sign in to comment.