More Discriminative Sentence Embeddings via Semantic Graph Smoothing

Chakib Fettal, Lazhar Labiod, Mohamed Nadif


Abstract
This paper explores an empirical approach to learn more discriminantive sentence representations in an unsupervised fashion. Leveraging semantic graph smoothing, we enhance sentence embeddings obtained from pretrained models to improve results for the text clustering and classification tasks. Our method, validated on eight benchmarks, demonstrates consistent improvements, showcasing the potential of semantic graph smoothing in improving sentence embeddings for the supervised and unsupervised document categorization tasks.
Anthology ID:
2024.eacl-short.2
Volume:
Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 2: Short Papers)
Month:
March
Year:
2024
Address:
St. Julian’s, Malta
Editors:
Yvette Graham, Matthew Purver
Venue:
EACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
8–13
Language:
URL:
https://aclanthology.org/2024.eacl-short.2
DOI:
Bibkey:
Cite (ACL):
Chakib Fettal, Lazhar Labiod, and Mohamed Nadif. 2024. More Discriminative Sentence Embeddings via Semantic Graph Smoothing. In Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 2: Short Papers), pages 8–13, St. Julian’s, Malta. Association for Computational Linguistics.
Cite (Informal):
More Discriminative Sentence Embeddings via Semantic Graph Smoothing (Fettal et al., EACL 2024)
Copy Citation:
PDF:
https://aclanthology.org/2024.eacl-short.2.pdf