Challenge: Recent research trend is to refine or fine-tune pretrained word embeddings.
Approach: They propose a method for refining pretrained word embeddings using layer-wise relevance propagation using a neural network.
Outcome: The proposed method achieves higher performance than the original vectors.

Similar Papers

Distilling Relation Embeddings from Pretrained Language Models (2021.emnlp-main)

Copied to clipboard

Challenge: Pre-trained language models capture a surprisingly rich amount of lexical knowledge, but it is unclear to what extent relation embeddings can be used to encode relational knowledge.
Approach: They found that word vector differences capture lexical relations . relationship embeddings can be used to encode relational knowledge .
Outcome: The results are highly competitive on analogy (unsupervised) and relation classification (supervised) benchmarks, even without any task-specific fine-tuning.
Advances in Pre-Training Distributed Word Representations (L18-1)

Copied to clipboard

Challenge: Pre-trained word representations are a building block of many Natural Language Processing and Machine Learning applications.
Approach: They propose to combine known tricks and a set of publicly available pre-trained word vector representations to train high-quality representations.
Outcome: The proposed models outperform the current state of the art on a number of tasks while maintaining a high training speed to scale to massive amount of data.
Autoencoding Improves Pre-trained Word Embeddings (2020.coling-main)

Copied to clipboard

Challenge: Existing work has shown that word embeddings are distributed in a narrow cone and that centering and projection can improve the accuracy of pre-trained word embeds without requiring additional training data.
Approach: They propose to remove the top principal components from pre-trained word embeddings and center and project them onto principal component vectors to reinstate isotropy in the embeddable space.
Outcome: The proposed method is equivalent to applying a linear autoencoder to minimize the squared L2 reconstruction error.
Enhancing Word Embeddings with Knowledge Extracted from Lexical Resources (2020.acl-srw)

Copied to clipboard

Challenge: In this paper, we present an effective method for semantic specialization of word vector representations.
Approach: They propose a method for semantic specialization of word vector representations using BabelNet.
Outcome: The proposed method improves on word similarity and dialog state tracking tasks.
Leveraging the Structure of Pre-trained Embeddings to Minimize Annotation Effort (2024.naacl-long)

Copied to clipboard

Challenge: Current approaches for text classification are based on fine-tuning the representations computed by large language models.
Approach: They propose to exploit structural properties of pre-trained embeddings to spread information . they use a semisupervised strategy to train models with minimal annotation effort .
Outcome: The proposed method outperforms self-training and random walk labels on different datasets.
Static Word Embeddings for Sentence Semantic Representation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to learn fixed-length embeddings for sentence semantics require large computational cost, making it difficult to process billions of sentences cost-efficiently or deploy models on resource-constrained devices such as smartphones.
Approach: They propose to extract word embeddings from a pre-trained Sentence Transformer and improve them with sentence-level principal component analysis followed by knowledge distillation or contrastive learning.
Outcome: The proposed model outperforms existing models on sentence semantic tasks and surpasses a basic Sentence Transformer model (SimCSE) on a text embedding benchmark.
Improving Word Embeddings through Iterative Refinement of Word- and Character-level Models (2020.coling-main)

Copied to clipboard

Challenge: Embedding of rare and out-of-vocabulary words is an important open NLP problem . standard embedding models are not useful for recommending jobs to users with rare or unseen words .
Approach: They propose to train a character-level neural network to reproduce word embeddings . they then use the model to assign vectors to any input string, including rare words .
Outcome: The proposed method outperforms existing methods on word similarity data sets and can be applied to job title normalization in the e-recruitment domain.
Using Context-to-Vector with Graph Retrofitting to Improve Word Embeddings (2022.acl-long)

Copied to clipboard

Challenge: Contextualized embeddings are expensive and resource-demanding, hence environmentally unfriendly.
Approach: They propose a method to convert contextualized embeddings from pre-trained models into static embeddables using synonym knowledge and weighted vector distribution.
Outcome: The proposed method outperforms baseline embeddings by a large margin through extrinsic and intrinsic tasks.
ReWE: Regressing Word Embeddings for Regularization of Neural Machine Translation Systems (N19-1)

Copied to clipboard

Challenge: Existing methods to regularize neural machine translation are limited in low-resource settings.
Approach: They propose a method that uses regressing word embeddings to regularize neural machine translation.
Outcome: The proposed system improves on a strong baseline and a state-of-the-art system.
Embeddings in Natural Language Processing (2020.coling-tutorials)

Copied to clipboard

Challenge: Embeddings have been a key topic of interest in NLP for the past decade . a quick warm-up introduction to NLP and why it is important to have a semantic comprehension of texts .
Approach: This tutorial will provide a high-level synthesis of the main embedding techniques in NLP . it will start with word embedds and then move to other types of embeddable vectors .
Outcome: This tutorial will provide a high-level synthesis of the main embedding techniques in NLP . it will start with word embedds and move to other types of embeddable representations .

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