Hierarchical Softmax

سوفت ماكس الهرمي

بديل حوسبي لدالة سوفت ماكس الكاملة يرتّب الكلمات كأوراق شجرة ثنائية، فيحوّل تنبؤ كلمة واحدة من V خيار إلى سلسلة قرارات ثنائية بطول log₂V.

A computational alternative to full softmax that arranges words as leaves of a binary tree, converting a V-way prediction into a sequence of log₂V binary decisions.

Also translated asالسوفت ماكس المتدرج، التقسيم الشجري الاحتمالي

First appears in this corpus in: Distributed Representations of Words and Phrases and Their Compositionality (2013)

Appears in these papers

DeepWalk: Online Learning of Social Representations2014 in the sky ✦
DeepWalk: Online Learning of Social Representations2014 in the sky ✦
Distributed Representations of Words and Phrases and Their Compositionality2013 in the sky ✦