Return of the RNN: Residual Recurrent Networks for Invertible Sentence Embeddings

Jeremy Wilkerson
3/23/2023
cs.CLcs.LG

No confident code implementation found for this paper.

Abstract

This study presents a novel model for invertible sentence embeddings using a residual recurrent network trained on an unsupervised encoding task. Rather than the probabilistic outputs common to neural machine translation models, our approach employs a regression-based output layer to reconstruct the input sequence's word vectors. The model achieves high accuracy and fast training with the ADAM optimizer, a significant finding given that RNNs typically require memory units, such as LSTMs, or second-order optimization methods. We incorporate residual connections and introduce a "match drop" technique, where gradients are calculated only for incorrect words. Our approach demonstrates potential for various natural language processing applications, particularly in neural network-based systems that require high-quality sentence embeddings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wilkerson2023return,
  title  = {Return of the RNN: Residual Recurrent Networks for Invertible Sentence Embeddings},
  author = {Jeremy Wilkerson},
  year   = {2023},
  eprint = {2303.13570},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.13570v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.13570.svg)](https://codeofpaper.com/paper/2303.13570)

Discussion