Efficient Purely Convolutional Text Encoding
Computation and Language
2018-08-06 v1
Abstract
In this work, we focus on a lightweight convolutional architecture that creates fixed-size vector embeddings of sentences. Such representations are useful for building NLP systems, including conversational agents. Our work derives from a recently proposed recursive convolutional architecture for auto-encoding text paragraphs at byte level. We propose alternations that significantly reduce training time, the number of parameters, and improve auto-encoding accuracy. Finally, we evaluate the representations created by our model on tasks from SentEval benchmark suite, and show that it can serve as a better, yet fairly low-resource alternative to popular bag-of-words embeddings.
Cite
@article{arxiv.1808.01160,
title = {Efficient Purely Convolutional Text Encoding},
author = {Szymon Malik and Adrian Lancucki and Jan Chorowski},
journal= {arXiv preprint arXiv:1808.01160},
year = {2018}
}
Comments
As accepted to: LaCATODA Workshop, ICML 2018