Output Functions
Hierarchical Softmax
Hierarchical Softmax is a is an alternative to softmax that is faster to evaluate: it is $O\left(\log{n}\right)$ time to evaluate compared to $O\left(n\right)$ for softmax. It utilises a multi-layer binary tree, where the probability of a word is calculated through the product of probabilities on each edge on the path to that node. See the Figure to the right for an example of where the product calculation would occur for the word "I'm".
(Introduced by Morin and Bengio)
Image Credit: Steven Schmatz
Papers
| Paper | Code | Results | Date | Stars |
|---|
Tasks
| Task | Papers | Share |
|---|---|---|
| Classification | 3 | 20.00% |
| General Classification | 3 | 20.00% |
| Extreme Multi-Label Classification | 2 | 13.33% |
| Multi-Label Classification | 2 | 13.33% |
| Text Classification | 1 | 6.67% |
| Speech Recognition | 1 | 6.67% |
| Language Modelling | 1 | 6.67% |
| Sentence | 1 | 6.67% |
| Sentence Compression | 1 | 6.67% |
Usage Over Time
Components
| Component | Type |
|
|---|---|---|
| 🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |
