Challenge: Existing methods to adapt pretrained embeddings to a large corpus are limited and do not provide sufficient quality.
Approach: They propose to use a small corpus D_T to pretrain embeddings that accurately capture the sense of words in a limited set of focused topics.
Outcome: The proposed embeddings capture the sense of words in a topic in spite of the limited size of the corpus D_T.

Similar Papers

Searching for the X-Factor: Exploring Corpus Subjectivity for Word Embeddings (P18-1)

Copied to clipboard

Challenge: Existing word embedding methods for natural language processing are limited in their ability to produce dense word embeds.
Approach: They propose a word embedding SentiVec which is infused with sentiment information from a lexical resource and outperforms baselines on subjectivity-sensitive tasks.
Outcome: The proposed word embedding SentiVec outperforms baselines on subjectivity-sensitive tasks.
Debiasing Pre-trained Contextualised Embeddings (2021.eacl-main)

Copied to clipboard

Challenge: a study of contextualised word embeddings shows discriminative biases are encoded in contextualised embeddables.
Approach: They propose a fine-tuning method that can be applied at token- or sentence-levels to debias pre-trained contextualised embeddings.
Outcome: The proposed method can be applied at token- or sentence-levels to debias pre-trained models without requiring retrains.
Interpreting Pretrained Contextualized Representations via Reductions to Static Embeddings (2020.acl-main)

Copied to clipboard

Challenge: Contextualized representations have become the default for downstream NLP applications.
Approach: They propose a method for converting from contextualized representations to static lookup-table embeddings and apply it to 5 popular pretrained models and 9 sets of pretrained weights.
Outcome: The proposed methods show that pooling over many contexts significantly improves representational quality under intrinsic evaluation.
Contextual Embeddings: When Are They Worth It? (2020.acl-main)

Copied to clipboard

Challenge: In recent years, rich contextual embeddings have enabled rapid progress on benchmarks like GLUE, but require significant computational resources during pretraining and during downstream task training and inference.
Approach: They empirically compare contextual embeddings with classic pretrained embedders and a random word embeddable with a simple baseline.
Outcome: The proposed models perform within 5 to 10% accuracy on industry-scale data.
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.
Syntactic Data Augmentation Increases Robustness to Inference Heuristics (2020.acl-main)

Copied to clipboard

Challenge: Pretrained neural models lack sensitivity to word order on controlled challenge sets . augmentation methods that improve accuracy on standard training sets may be a problem .
Approach: They propose to augment standard training sets with syntactically informative examples by applying syntastic transformations to sentences from the MNLI corpus.
Outcome: The proposed method improved BERT’s accuracy on controlled examples that diagnose sensitivity to word order from 0.28 to 0.73 without affecting performance on the MNLI test set.
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.
More Embeddings, Better Sequence Labelers? (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective .
Approach: They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages .
Outcome: The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders.
Virtual Data Augmentation: A Robust and General Framework for Fine-tuning Pre-trained Models (2021.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that powerful pre-trained language models can be fooled by small perturbations or intentional attacks.
Approach: They propose a framework for fine-tuning PLMs using a masked language model and Gaussian noise to augment semantically relevant examples with sufficient diversity.
Outcome: The proposed framework improves the robustness of pre-trained language models and alleviates performance degradation under adversarial attacks.
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.

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