Skip to content

Navigation Menu

Sign in
Sign up

Latest commit

History

40 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Skipgram with Hierarchical Softmax

Skipgram is widely studied in the context of word variance representation learning(word2vec).

This is a C ++ implementation of Skip-gram with hierarchical softmax(hSm).
hSm can speed up parameter update by utilizing the constructed binary tree.

The properties of hSm are as follows:

  • The number of vectors that need to be updated is logarithmic order.
  • By using the Huffman tree, the data approaches balanced data at each node.

Dependencies

  • gcc 7.2.0
  • boost 1.66.0

Link

About

Skipgram with Hierarchical Softmax

Topics

Resources

Stars

6 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

AltStyle によって変換されたページ (->オリジナル) /