CLFeb 19, 2025

Refining Sentence Embedding Model through Ranking Sentences Generation with Large Language Models

arXiv:2502.13656v22 citationsh-index: 40ACL
Originality Incremental advance
AI Analysis

This work addresses scalability issues in NLP tasks by reducing annotation dependency, though it is incremental as it builds on existing LLM-based generation methods.

The paper tackled the problem of limited scalability in sentence embedding models due to reliance on manual labels by proposing a method to generate ranking sentences with controlled LLM generation, achieving new state-of-the-art performance on multiple benchmarks.

Sentence embedding is essential for many NLP tasks, with contrastive learning methods achieving strong performance using annotated datasets like NLI. Yet, the reliance on manual labels limits scalability. Recent studies leverage large language models (LLMs) to generate sentence pairs, reducing annotation dependency. However, they overlook ranking information crucial for fine-grained semantic distinctions. To tackle this challenge, we propose a method for controlling the generation direction of LLMs in the latent space. Unlike unconstrained generation, the controlled approach ensures meaningful semantic divergence. Then, we refine exist sentence embedding model by integrating ranking information and semantic information. Experiments on multiple benchmarks demonstrate that our method achieves new SOTA performance with a modest cost in ranking sentence synthesis.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes