Parameter-Efficient Transformer Embeddings
원문 초록
Embedding layers in transformer-based NLP models typically account for the largest share of model parameters, scaling with vocabulary size but not yielding performance gains proportional to scale. We propose an alternative approach in which token embedding vectors are first generated deterministically, directly from the token IDs using a Fourier expansion of their normalized values, followed by a lightweight multilayer perceptron (MLP) that captures higher-order interactions. We train standard transformers and our architecture on natural language inference tasks (SNLI and MNLI), and evaluate zero-shot performance on sentence textual similarity (STS-B). Our results demonstrate that the proposed method achieves competitive performance using significantly fewer parameters, trains faster, and operates effectively without the need for dropout. This proof-of-concept study highlights the potential for scalable, memory-efficient language models and motivates further large-scale experimentation based on our findings.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Prompting Enhances Sentence Embeddings in LLMs through Inference-Time Steering
Intrinsic vs. Extrinsic Evaluation of Czech Sentence Embeddings: Semantic Relevance Doesn't Help with MT Evaluation
CASE -- Condition-Aware Sentence Embeddings for Conditional Semantic Textual Similarity Measurement
A MISMATCHED Benchmark for Scientific Natural Language Inference
Information Leakage of Sentence Embeddings via Generative Embedding Inversion Attacks
IPCGRL: Language-Instructed Reinforcement Learning for Procedural Level Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.