MoRTy: Unsupervised Learning of Task-specialized Word Embeddings by Autoencoding
- Nils Rethmeier,
- German Research Center for Artificial Intelligence,
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewHost publication Subtitle
RepL4NLP-2019Original language
EnglishPages from-to (Number of pages)
Pages 49-54Publication milestones
- Accepted/In press - 2019
- Published - 2019
Publication status
Published - 2019
Place of publication
FlorencePublisher
Association for Computational Linguistics, United StatesISBN (Electronic)
978-1-950737-35-2Host publication title
Proceedings of the 4th Workshop on Representation Learning for NLP (RepL4NLP-2019))Abstract
Word embeddings have undoubtedly revolutionized NLP. However, pre-trained embeddings do not always work for a specific
task (or set of tasks), particularly in limited resource setups. We introduce a simple
yet effective, self-supervised post-processing
method that constructs task-specialized word
representations by picking from a menu of
reconstructing transformations to yield improved end-task performance (MORTY). The
method is complementary to recent state-of-the-art approaches to inductive transfer via
fine-tuning, and forgoes costly model architectures and annotation. We evaluate MORTY
on a broad range of setups, including different
word embedding methods, corpus sizes and
end-task semantics. Finally, we provide a surprisingly simple recipe to obtain specialized
embeddings that better fit end-tasks
task (or set of tasks), particularly in limited resource setups. We introduce a simple
yet effective, self-supervised post-processing
method that constructs task-specialized word
representations by picking from a menu of
reconstructing transformations to yield improved end-task performance (MORTY). The
method is complementary to recent state-of-the-art approaches to inductive transfer via
fine-tuning, and forgoes costly model architectures and annotation. We evaluate MORTY
on a broad range of setups, including different
word embedding methods, corpus sizes and
end-task semantics. Finally, we provide a surprisingly simple recipe to obtain specialized
embeddings that better fit end-tasks
Access to documents
Accepted author manuscript, 224.48 KB
Accepted author manuscript
