arXiv:1802.07374
On the scaling of polynomial features for representation matching
원문 초록
In many neural models, new features as polynomial functions of existing ones are used to augment representations. Using the natural language inference task as an example, we investigate the use of scaled polynomials of degree 2 and above as matching features. We find that scaling degree 2 features has the highest impact on performance, reducing classification error by 5% in the best models.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DS@GT at CheckThat! 2025: Evaluating Context and Tokenization Strategies for Numerical Fact Verification
Theorem-of-Thought: A Multi-Agent Framework for Abductive, Deductive, and Inductive Reasoning in Language Models
A MISMATCHED Benchmark for Scientific Natural Language Inference
Drop Dropout on Single-Epoch Language Model Pretraining
LiTEx: A Linguistic Taxonomy of Explanations for Understanding Within-Label Variation in Natural Language Inference
Learning to Reason via Mixture-of-Thought for Logical Reasoning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.