Pith. sign in

REVIEW 1 cited by

Von Mises-Fisher Loss for Training Sequence to Sequence Models with Continuous Outputs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.04616 v3 pith:D5G3NZC5 submitted 2018-12-10 cs.CL cs.LGstat.ML

classification cs.CLcs.LGstat.ML
keywords modelslayercontinuoussoftmaxtrainingtranslationdistributionerrors
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Softmax function is used in the final layer of nearly all existing sequence-to-sequence models for language generation. However, it is usually the slowest layer to compute which limits the vocabulary size to a subset of most frequent types; and it has a large memory footprint. We propose a general technique for replacing the softmax layer with a continuous embedding layer. Our primary innovations are a novel probabilistic loss, and a training and inference procedure in which we generate a probability distribution over pre-trained word embeddings, instead of a multinomial distribution over the vocabulary obtained via softmax. We evaluate this new class of sequence-to-sequence models with continuous outputs on the task of neural machine translation. We show that our models obtain upto 2.5x speed-up in training time while performing on par with the state-of-the-art models in terms of translation quality. These models are capable of handling very large vocabularies without compromising on translation quality. They also produce more meaningful errors than in the softmax-based models, as these errors typically lie in a subspace of the vector space of the reference translations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Deep Sparse Latent Feature Models for Knowledge Graph Completion

    cs.CL 2024-11 conditional novelty 6.0 of 10

    DSLFM-KGC couples sparse latent community models with BERT text features and contrastive learning, improving state-of-the-art scores on Wikidata5M-Ind, WN18RR, and UMLS.

Pith tools