News for hackers. Stuff that matters.
Re:No training required: Exploring random encoders for sente... by jeromebaek on Wednesday January 30, 2019 @01:50PM (#19037979)
Interesting paper. I'd like to know how this compares with even more naive methods like simple summation. If this method is an application of Cover's theorem it should handily beat summation or any other simple method that places the sentence embedding in the same dimension as the word embeddings.
Re:No training required: Exploring random encoders for sente... by yorwba on Wednesday January 30, 2019 @01:56PM (#19038058)
From the "related work" section of the paper:

The nowadays surprisingly poor performance of the models in Hill et al. (2016) can at least partly be explained because 1) they use poorer (older) word embeddings; and 2) FastSent sentence representations are of the same dimensionality as the input word embeddings, while they are compared in the same table to much higher-dimensional representations.

See also figure 1 for the increase in performance across tasks when the embedding dimension is increased.