Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/119010
| Title: | ESE : espresso sentence embeddings | Authors: | Li, X Li, Z Li, J Xie, H Li, Q |
Issue Date: | 2025 | Source: | The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, Apr 24 2025, https://openreview.net/forum?id=plgLA2YBLH | Abstract: | High-quality sentence embeddings are fundamental in many natural language processing (NLP) tasks, such as semantic textual similarity (STS) and retrieval-augmented generation (RAG). However, most existing methods leverage fixed-length sentence embeddings from full-layer language models, which lack the scalability to accommodate the diverse available resources across various applications. Viewing this gap, we propose a novel sentence embedding model Espresso Sentence Embeddings (ESE) with two learning processes. First, the learn-to-express process encodes more salient representations to shallow layers. Second, the learn-to-compress process compacts essential features into the initial dimensions using Principal Component Analysis (PCA). This way, ESE can scale model depth via the former process and embedding size via the latter. Extensive experiments on STS and RAG suggest that ESE can effectively produce high-quality sentence embeddings with less model depth and embedding size, enhancing inference efficiency. The code is available at https://github.com/SeanLee97/AnglE/blob/main/README_ESE.md. | Publisher: | OpenReview.net | Description: | The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, Apr 24 2025 | Rights: | CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/) The following publication Li, X., Li, Z., Li, J., Xie, H., & Li, Q. (2025). ESE: Espresso sentence embeddings. In The Thirteenth International Conference on Learning Representations (ICLR) is available at https://openreview.net/forum?id=plgLA2YBLH. |
| Appears in Collections: | Conference Paper |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


