word2vec Parameter Learning Explained
The word2vec model and application by Mikolov et al. have attracted a great amount of attention in recent two years. The vector representations of words learned by word2vec models have been shown to carry semantic meanings and are useful in various NLP tasks. As an increasing number of researchers would like to experiment with word2vec or similar techniques, I notice that there lacks a material that comprehensively explains the parameter learning process of word embedding models in details, thus preventing researchers that are non-experts in neural networks from understanding the working mechanism of such models. This note provides detailed derivations and explanations of the parameter update equations of the word2vec models, including the original continuous bag-of-word (CBOW) and skip-gram (SG) models, as well as advanced optimization techniques, including hierarchical softmax and negative sampling. Intuitive interpretations of the gradient equations are also provided alongside mathematical derivations. In the appendix, a review on the basics of neuron networks and backpropagation is provided. I also created an interactive demo, wevi, to facilitate the intuitive understanding of the model.
Code (8)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Preferred Design of Hierarchical Distribution Matching
Distribution matching and dematching (DM/invDM) are key functions in probabilistic shaping (PS). Recently techniques for low complexity implementation of DM/invDM have been well studied. Our previously proposed hierarchi…
Language Model Behavioral Phases are Consistent Across Architecture, Training Data, and Scale
We show that across architecture (Transformer vs. Mamba vs. RWKV), training dataset (OpenWebText vs. The Pile), and scale (14 million parameters to 12 billion parameters), autoregressive language models exhibit highly co…
Semantic SimilarityAI Buzzwords Explained: Multi-Agent Path Finding (MAPF)
Explanation of the hot topic "multi-agent path finding".
Multi-Agent Path FindingParsimonious Topic Models with Salient Word Discovery
We propose a parsimonious topic model for text corpora. In related models such as Latent Dirichlet Allocation (LDA), all words are modeled topic-specifically, even though many words occur with similar frequencies across …
Topic ModelsSubsampling for Knowledge Graph Embedding Explained
In this article, we explain the recent advance of subsampling methods in knowledge graph embedding (KGE) starting from the original one used in word2vec.
Graph EmbeddingKnowledge Graph Embedding