{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/hierarchical-softmax","slug":"hierarchical-softmax","name":"Hierarchical Softmax","full_name":"Hierarchical Softmax","full_name_withheld":false,"description_markdown":"**Hierarchical Softmax** is a is an alternative to [softmax](https://paperswithcode.com/method/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\".\r\n\r\n(Introduced by Morin and Bengio)\r\n\r\nImage Credit: [Steven Schmatz](https://www.quora.com/profile/Steven-Schmatz)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Output Functions","url":"/methods/category/output-functions","pwc_aliases":[]}],"n_papers_tagged":12,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"vq-logits-compressing-the-output-bottleneck","title":"VQ-Logits: Compressing the Output Bottleneck of Large Language Models via Vector Quantized Logits","date":"2025-05-15","arxiv_id":"2505.10202","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-rates-for-softmax-gating-mixture","title":"Convergence Rates for Softmax Gating Mixture of Experts","date":"2025-03-05","arxiv_id":"2503.03213","n_code_links":0,"syntology":null},{"paper":null,"slug":"cross-lingual-embedding-clustering-for","title":"Cross-lingual Embedding Clustering for Hierarchical Softmax in Low-Resource Multilingual Speech Recognition","date":"2025-01-29","arxiv_id":"2501.17615","n_code_links":0,"syntology":null},{"paper":"/paper/global-hierarchical-neural-networks-using","slug":"global-hierarchical-neural-networks-using","title":"Global Hierarchical Neural Networks using Hierarchical Softmax","date":"2023-08-02","arxiv_id":"2308.01210","n_code_links":1,"syntology":null},{"paper":"/paper/hierarchical-softmax-for-end-to-end-low","slug":"hierarchical-softmax-for-end-to-end-low","title":"Hierarchical Softmax for End-to-End Low-resource Multilingual Speech Recognition","date":"2022-04-08","arxiv_id":"2204.03855","n_code_links":1,"syntology":null},{"paper":"/paper/probabilistic-label-trees-for-extreme-multi","slug":"probabilistic-label-trees-for-extreme-multi","title":"Probabilistic Label Trees for Extreme Multi-label Classification","date":"2020-09-23","arxiv_id":"2009.11218","n_code_links":2,"syntology":null},{"paper":null,"slug":"190600294","title":"On the computational complexity of the probabilistic label tree algorithms","date":"2019-06-01","arxiv_id":"1906.00294","n_code_links":0,"syntology":null},{"paper":null,"slug":"effectiveness-of-hierarchical-softmax-in","title":"Effectiveness of Hierarchical Softmax in Large Scale Classification Tasks","date":"2018-12-13","arxiv_id":"1812.05737","n_code_links":0,"syntology":null},{"paper":"/paper/a-no-regret-generalization-of-hierarchical","slug":"a-no-regret-generalization-of-hierarchical","title":"A no-regret generalization of hierarchical softmax to extreme multi-label classification","date":"2018-10-27","arxiv_id":"1810.11671","n_code_links":1,"syntology":null},{"paper":null,"slug":"self-organized-hierarchical-softmax","title":"Self-organized Hierarchical Softmax","date":"2017-07-26","arxiv_id":"1707.08588","n_code_links":0,"syntology":null},{"paper":"/paper/word2vec-parameter-learning-explained","slug":"word2vec-parameter-learning-explained","title":"word2vec Parameter Learning Explained","date":"2014-11-11","arxiv_id":"1411.2738","n_code_links":8,"syntology":{"ran":9,"of":9,"n_ran_checked":7,"n_instrument":2,"unverified":0,"pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ronxin/wevi"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/distributed-representations-of-words-and-1","slug":"distributed-representations-of-words-and-1","title":"Distributed Representations of Words and Phrases and their Compositionality","date":"2013-10-16","arxiv_id":"1310.4546","n_code_links":51,"syntology":{"ran":21,"of":26,"n_ran_checked":20,"n_instrument":1,"unverified":5,"pointer_only":4,"phrase":"21 ran (of which 2 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":null}}],"papers_shown":12,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":12,"with_a_code_link":6,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/hierarchical-softmax/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/hierarchical-softmax/papers/ran/1","json":"/method/hierarchical-softmax/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/classification-1","name":"Classification","papers":3},{"task":"/task/classification","name":"General Classification","papers":3},{"task":"/task/extreme-multi-label-classification","name":"Extreme Multi-Label Classification","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/multi-label-classification-2","name":"MUlTI-LABEL-ClASSIFICATION","papers":2},{"task":"/task/multi-label-classification","name":"Multi-Label Classification","papers":2},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":2},{"task":"/task/speech-recognition-1","name":"speech-recognition","papers":2},{"task":"/task/automatic-speech-recognition-2","name":"Automatic Speech Recognition","papers":1},{"task":"/task/automatic-speech-recognition","name":"Automatic Speech Recognition (ASR)","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/mixture-of-experts","name":"Mixture-of-Experts","papers":1},{"task":"/task/multi-class-classification","name":"Multi-class Classification","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1},{"task":"/task/sentence","name":"Sentence","papers":1},{"task":"/task/sentence-compression","name":"Sentence Compression","papers":1},{"task":"/task/text-classification","name":"Text Classification","papers":1},{"task":"/task/parameter-estimation","name":"parameter estimation","papers":1},{"task":"/task/text-classification-1","name":"text-classification","papers":1}],"tasks_shown":20,"n_tasks":20,"usage_by_year":[{"year":"2013","papers":1},{"year":"2014","papers":1},{"year":"2017","papers":1},{"year":"2018","papers":2},{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2022","papers":1},{"year":"2023","papers":1},{"year":"2025","papers":3}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/hierarchical-softmax"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Hierarchical%20Softmax","read_at":"2026-10-05T00:57:32+00:00","query":"Hierarchical Softmax","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Hierarchical Softmax' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["F2-Softmax","WB-Softmax","CGF-Softmax","softmax-CPR","Gumbel-Softmax","Latent Softmax","Vertex-Softmax","Hierarchical ODE"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a5babdd90c284959c7a8dbd3fd50bc4f39caf29b902cca37118e9df625ad8f58","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}