Shortcut-Stacked Sentence Encoders for Multi-Domain Inference
원문 초록
We present a simple sequential sentence encoder for multi-domain natural language inference. Our encoder is based on stacked bidirectional LSTM-RNNs with shortcut connections and fine-tuning of word embeddings. The overall supervised model uses the above encoder to encode two input sentences into two vectors, and then uses a classifier over the vector combination to label the relationship between these two sentences as that of entailment, contradiction, or neural. Our Shortcut-Stacked sentence encoders achieve strong improvements over existing encoders on matched and mismatched multi-domain natural language inference (top non-ensemble single-model result in the EMNLP RepEval 2017 Shared Task (Nangia et al., 2017)). Moreover, they achieve the new state-of-the-art encoding result on the original SNLI dataset (Bowman et al., 2015).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A MISMATCHED Benchmark for Scientific Natural Language Inference
Parameter-Efficient Transformer Embeddings
Thunder-NUBench: A Benchmark for LLMs' Sentence-Level Negation Understanding
Static Word Embeddings for Sentence Semantic Representation
SALAD: Improving Robustness and Generalization through Contrastive Learning with Structure-Aware and LLM-Driven Augmented Data
Negation: A Pink Elephant in the Large Language Models' Room?
토론
이 논문과 연결된 포럼 글이 아직 없습니다.