{"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":"/paper/a-no-regret-generalization-of-hierarchical","title":"A no-regret generalization of hierarchical softmax to extreme multi-label classification","arxiv_id":"1810.11671","date":"2018-10-27","proceeding":"NeurIPS 2018 12","authors":["Marek Wydmuch","Kalina Jasinska","Mikhail Kuznetsov","Róbert Busa-Fekete","Krzysztof Dembczyński"],"abstract":"Extreme multi-label classification (XMLC) is a problem of tagging an instance\nwith a small subset of relevant labels chosen from an extremely large pool of\npossible labels. Large label spaces can be efficiently handled by organizing\nlabels as a tree, like in the hierarchical softmax (HSM) approach commonly used\nfor multi-class problems. In this paper, we investigate probabilistic label\ntrees (PLTs) that have been recently devised for tackling XMLC problems. We\nshow that PLTs are a no-regret multi-label generalization of HSM when\nprecision@k is used as a model evaluation metric. Critically, we prove that\npick-one-label heuristic - a reduction technique from multi-label to\nmulti-class that is routinely used along with HSM - is not consistent in\ngeneral. We also show that our implementation of PLTs, referred to as\nextremeText (XT), obtains significantly better results than HSM with the\npick-one-label heuristic and XML-CNN, a deep network specifically designed for\nXMLC problems. Moreover, XT is competitive to many state-of-the-art approaches\nin terms of statistical performance, model size and prediction time which makes\nit amenable to deploy in an online system.","url_abs":"http://arxiv.org/abs/1810.11671v1","url_pdf":"http://arxiv.org/pdf/1810.11671v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-no-regret-generalization-of-hierarchical","repo_url":"https://github.com/mwydmuch/extremeText","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"extreme-multi-label-classification","task_name":"Extreme Multi-Label Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"multi-label-classification-2","task_name":"MUlTI-LABEL-ClASSIFICATION"},{"task_slug":"multi-label-classification","task_name":"Multi-Label Classification"}],"methods":[{"method_slug":"hierarchical-softmax","method_name":"Hierarchical Softmax"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.11671","atlas_url":"https://app.syntology.ai/?focus=1810.11671","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1810.11671"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.11671\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.11671"},"call":"get_concepts_for_paper(arxiv_id=\"1810.11671\")"}],"by_repo":[{"repo":"mwydmuch/extremeText","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"90ec3c7e5f757c1351c52d156fbdb285aa79a1f9d4e5ee63c7693298bc9cdddf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}