Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Simple Language Model based on PMI Matrix Approximations (1707.05266v1)

Published 17 Jul 2017 in cs.CL

Abstract: In this study, we introduce a new approach for learning LLMs by training them to estimate word-context pointwise mutual information (PMI), and then deriving the desired conditional probabilities from PMI at test time. Specifically, we show that with minor modifications to word2vec's algorithm, we get principled LLMs that are closely related to the well-established Noise Contrastive Estimation (NCE) based LLMs. A compelling aspect of our approach is that our models are trained with the same simple negative sampling objective function that is commonly used in word2vec to learn word embeddings.

Citations (11)

Summary

We haven't generated a summary for this paper yet.