mlsanityData to 7 Oct 2026

Fast and Accurate Deep Bidirectional Language Representations for Unsupervised Learning

arXiv 2004.08097 ↗First posted 17 Apr 2020cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

Even though BERT achieves successful performance improvements in various supervised learning tasks, applying BERT for unsupervised tasks still holds a limitation that it requires repetitive inference for computing contextual language representations. To resolve the limitation, we propose a novel deep bidirectional language model called Transformer-based Text Autoencoder (T-TA). The T-TA computes contextual language representations without repetition and has benefits of the deep bidirectional architecture like BERT. In run-time experiments on CPU environments, the proposed T-TA performs over six times faster than the BERT-based model in the reranking task and twelve times faster in the semantic similarity task. Furthermore, the T-TA shows competitive or even better accuracies than those of BERT on the above tasks.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 0; 2025: 1.

6 papers.