SEE: Sememe Entanglement Encoding for Transformer-bases Models Compression
Not on the map. Why?
Abstract (arXiv)
Transformer-based large language models exhibit groundbreaking capabilities, but their storage and computational costs are prohibitively high, limiting their application in resource-constrained scenarios. An effective approach is to eliminate redundant model parameters and computational costs while incorporating efficient expert-derived knowledge structures to achieve a balance between compression and performance. Therefore, we propose the textitSememe Entanglement Encoding (SEE) algorithm. Guided by expert prior knowledge, the model is compressed through the low-rank approximation idea. In Entanglement Embedding, basic semantic units such as sememes are represented as low-dimensional vectors, and then reconstructed into high-dimensional word embeddings through the combination of generalized quantum entanglement. We adapt the Sememe Entanglement Encoding algorithm to transformer-based models of different magnitudes. Experimental results indicate that our approach achieves stable performance while compressing model parameters and computational costs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 19 references that are in the map. First posted on arXiv 15 Dec 2024.
Builds on
10 of 19 references.
References · 10
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
- 2020Lite Transformer with Long-Short Range Attentioncited by 127
- 2019A Tensorized Transformer for Language Modelingcited by 86
- 2019OpenHowNet: An Open Sememe-based Lexical Knowledge Basecited by 21
- 2017The University of Edinburgh's Neural MT Systems for WMT17cited by 16
- 2019word2ket: Space-efficient Word Embeddings inspired by Quantum Entanglementcited by 14
- 2020Rank and run-time aware compression of NLP Applicationscited by 5
Built on by
Not cited yet.