<commit_before># word2vec
Implemention of multi-thread word2vec using c++11.
optimization: Adagrad


List:
* forget to reset total words (0), which slow down the learning rate to shrinkage
* trained words caculate error, subsample words is included
* vector index and word index in vocab is not equal
* create huffman tree: create n-1 non-leaf nodes
* know which word to update at each step: update input words vector not iteself
* Key points: upadte rule for hs and negtive sample
<commit_msg>adagrad<commit_after># word2vec
Implemention of multi-thread word2vec using c++11.
optimization: Adagrad


List:
* forget to reset total words (0), which slow down the learning rate to shrinkage
* trained words caculate error, subsample words is included
* vector index and word index in vocab is not equal
* create huffman tree: create n-1 non-leaf nodes
* know which word to update at each step: update input words vector not iteself
* Key points: upadte rule for hs and negtive sample
* adagrad: sum history grads += 

{'fraction_non_alphanumeric': 0.053201970443349754, 'fraction_numerical': 0.011822660098522168, 'mean_word_length': 4.707865168539326, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2180640', 'n_tokens_mistral': 295, 'n_tokens_neox': 285, 'n_words': 150}