REVIEW 2 cited by
Matrix Factorization using Window Sampling and Negative Sampling for Improved Word Representations
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
read the original abstract
In this paper, we propose LexVec, a new method for generating distributed word representations that uses low-rank, weighted factorization of the Positive Point-wise Mutual Information matrix via stochastic gradient descent, employing a weighting scheme that assigns heavier penalties for errors on frequent co-occurrences while still accounting for negative co-occurrence. Evaluation on word similarity and analogy tasks shows that LexVec matches and often outperforms state-of-the-art methods on many of these tasks.
Forward citations
Cited by 2 Pith papers
-
Probing the contents of semantic representations from text, behavior, and brain data using the psychNorms metabase
Behavior-based word embeddings, especially from free associations, capture unique affective, agentic, and socio-moral information compared to text-based embeddings.
-
Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matrices
Stack-SVD is minimax optimal for fully shared singular subspaces; with partial sharing, rate-optimal estimation requires locating shared vectors, and the proposed tracing algorithm does so under orthogonality and stro...
Discussion (0). Continue with ORCID to comment.