Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks (D19-1)

Copied to clipboard

Challenge: Existing methods for finding similar sentences require multiple inferences . a modern GPU requires 65 hours to find the most similar pair in 10,000 sentences .
Approach: They propose a modification of the pretrained BERT network that uses siamese and triplet networks to derive semantically meaningful sentence embeddings.
Outcome: The proposed method outperforms existing methods on sentence-pair regression tasks.

Similar Papers

BERT Has More to Offer: BERT Layers Combination Yields Better Sentence Embeddings (2023.findings-emnlp)

Copied to clipboard

Challenge: Obtaining sentence representations from BERT-based models is valuable as it takes less time to pre-compute a one-time representation of the data and then use it for the downstream tasks.
Approach: They propose to combine certain layers of a BERT-based model rested on the data set and model to achieve substantially better results.
Outcome: The proposed method outperforms baseline models on seven semantic textual similarity datasets and on eight transfer data sets.
Language-agnostic BERT Sentence Embedding (2022.acl-long)

Copied to clipboard

Challenge: Existing methods for learning bilingual sentence embeddings are not well explored.
Approach: They propose to combine best methods for learning multilingual sentence embeddings with pre-trained models to achieve 83.7% bi-text retrieval accuracy over 112 languages on Tatoeba.
Outcome: The proposed model achieves 83.7% bi-text retrieval accuracy over 112 languages on Tatoeba, above the 65.5% achieved by LASER.
On the Sentence Embeddings from Pre-trained Language Models (2020.emnlp-main)

Copied to clipboard

Challenge: Pre-trained contextual representations like BERT have been widely used for NLP tasks.
Approach: They propose to transform anisotropic sentence embedding distribution to smooth and isotropic Gaussian distribution by normalizing flows that are learned with an unsupervised objective.
Outcome: The proposed method achieves significant performance gains over state-of-the-art embeddings on a variety of semantic textual similarity tasks.
An Unsupervised Sentence Embedding Method by Mutual Information Maximization (2020.emnlp-main)

Copied to clipboard

Challenge: Sentence BERT is inefficient for sentence-pair tasks as it needs to evaluate combinatorially many sentence pairs which is very time-consuming.
Approach: They propose a lightweight extension on top of BERT and a self-supervised learning objective to derive meaningful sentence embeddings in an unsupervised manner.
Outcome: The proposed method outperforms baselines on common semantic textual similarity tasks and downstream supervised tasks and achieves performance competitive with supervised methods on various tasks.
SBERT studies Meaning Representations: Decomposing Sentence Embeddings into Explainable Semantic Features (2022.aacl-main)

Copied to clipboard

Challenge: Abstract Meaning Representation (S3BERT) embeddings are composed of explainable sub-embeddings that emphasize various sentence meaning features.
Approach: They propose to induce Semantically Structured Sentence BERT embeddings (S3BERT) that emphasize various sentence meaning features.
Outcome: The proposed model shows high correlation to human similarity ratings, but lacks interpretability.
Locality Preserving Sentence Encoding (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing word embeddings can be used to learn sentence embedds on the sentence level.
Approach: They propose a sentence embedding method that uses the inner product to compute semantic similarity between sentences.
Outcome: The proposed method encodes sentences better in the sense of semantic structures.
Frustratingly Easy Performance Improvements for Low-resource Setups: A Tale on BERT and Segment Embeddings (2022.lrec-1)

Copied to clipboard

Challenge: Understanding why contextualized embeddings work is still an active area of research.
Approach: They propose to use a BERT architecture to encode a sub-word, position and a segment embedding as input representations for each sub- word.
Outcome: The proposed model performs well on single-sentence prediction tasks while swapping segment IDs in paired-sentent tasks.
Sentence Meta-Embeddings for Unsupervised Semantic Textual Similarity (2020.acl-main)

Copied to clipboard

Challenge: Existing word embeddings combine complementary strengths of their components to achieve unsupervised semantic similarity (STS).
Approach: They propose to ensemble pre-trained sentence encoders into sentence meta-embeddings to achieve unsupervised Semantic Textual Similarity (STS) they adapt dimensionality reduction, generalized Canonical Correlation Analysis and cross-view auto-encoders to their work.
Outcome: The proposed method achieves 3.7% to 6.4% Pearson’s r over single-source word embeddings on the STS Benchmark and on the StS12-STS16 datasets.
FASTMATCH: Accelerating the Inference of BERT-based Text Matching (2020.coling-main)

Copied to clipboard

Challenge: Recent pre-trained language models have shown state-of-the-art accuracies in text matching.
Approach: They propose a BERT-based text matching model where representations and interactions are decoupled . they propose generating final matching scores using a lightweight attention network .
Outcome: Experiments show that the proposed model can achieve up to 100X speed-up to BERT and RoBERTa while keeping more up to 98.7% of the performance.
Are ELECTRA’s Sentence Embeddings Beyond Repair? The Case of Semantic Textual Similarity (2024.findings-emnlp)

Copied to clipboard

Challenge: ELECTRA's sentence embeddings are poorer than BERT's, resulting in a significant drop in performance for semantic textual similarity (STS).
Approach: They propose to use a truncated model fine-tuning method to repair the embeddings by reducing the number of parameters and producing smaller embeddables.
Outcome: The proposed method improves Spearman correlation coefficient by over 8 points while increasing parameter efficiency on the STS Benchmark.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations