Pith. sign in

REVIEW 2 cited by

How to evaluate word embeddings? On importance of data efficiency and simple supervised tasks

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 1702.02170 v1 pith:MUOZ2RF5 submitted 2017-02-07 cs.CL

classification cs.CL
keywords wordembeddingsevaluationlearningdatasupervisedanalysisavailable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Maybe the single most important goal of representation learning is making subsequent learning faster. Surprisingly, this fact is not well reflected in the way embeddings are evaluated. In addition, recent practice in word embeddings points towards importance of learning specialized representations. We argue that focus of word representation evaluation should reflect those trends and shift towards evaluating what useful information is easily accessible. Specifically, we propose that evaluation should focus on data efficiency and simple supervised tasks, where the amount of available data is varied and scores of a supervised model are reported for each subset (as commonly done in transfer learning). In order to illustrate significance of such analysis, a comprehensive evaluation of selected word embeddings is presented. Proposed approach yields a more complete picture and brings new insight into performance characteristics, for instance information about word similarity or analogy tends to be non--linearly encoded in the embedding space, which questions the cosine-based, unsupervised, evaluation methods. All results and analysis scripts are available online.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. A New Pair of GloVes

    cs.CL 2025-07 conditional novelty 5.0 of 10

    New 2024 GloVe embeddings, trained on updated Wikipedia, Gigaword, and a Dolma subset, match the 2014 models on structural benchmarks while improving NER on temporally recent and non-Western data.

  2. RiverText: A Python Library for Training and Evaluating Incremental Word Embeddings from Text Data Streams

    cs.CL 2025-06 conditional novelty 5.0 of 10

    RiverText provides a standardized Python toolkit for training and periodically evaluating incremental word embeddings on text streams.

Pith tools