Methods › General › Output Functions › Hierarchical Softmax

Hierarchical Softmax

12 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Hierarchical Softmax is a is an alternative to softmax that is faster to evaluate: it is O(logn) time to evaluate compared to O(n) 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

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: F2-Softmax; WB-Softmax; CGF-Softmax; softmax-CPR; Gumbel-Softmax; Latent Softmax; Vertex-Softmax; Hierarchical ODE.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 12 · with a code link: 6 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 12 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 12 of 12, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Classification3
General Classification3
Extreme Multi-Label Classification2
Language Modeling2
Language Modelling2
MUlTI-LABEL-ClASSIFICATION2
Multi-Label Classification2
Speech Recognition2
speech-recognition2
Automatic Speech Recognition1
Automatic Speech Recognition (ASR)1
Decoder1
Mixture-of-Experts1
Multi-class Classification1
Quantization1
Sentence1
Sentence Compression1
Text Classification1
parameter estimation1
text-classification1

Usage over time archive 2025-07-28

Papers per year tagged with Hierarchical Softmax: 2013 to 2025, peak 3 3 0 2013: 1 paper 2013 2014: 1 paper 2014 2015: 0 papers 2015 2016: 0 papers 2016 2017: 1 paper 2017 2018: 2 papers 2018 2019: 1 paper 2019 2020: 1 paper 2020 2021: 0 papers 2021 2022: 1 paper 2022 2023: 1 paper 2023 2024: 0 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (12 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Output Functions

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections