{"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/adversarial-extreme-multi-label","title":"Adversarial Extreme Multi-label Classification","arxiv_id":"1803.01570","date":"2018-03-05","proceeding":null,"authors":["Rohit Babbar","Bernhard Schölkopf"],"abstract":"The goal in extreme multi-label classification is to learn a classifier which\ncan assign a small subset of relevant labels to an instance from an extremely\nlarge set of target labels. Datasets in extreme classification exhibit a long\ntail of labels which have small number of positive training instances. In this\nwork, we pose the learning task in extreme classification with large number of\ntail-labels as learning in the presence of adversarial perturbations. This view\nmotivates a robust optimization framework and equivalence to a corresponding\nregularized objective.\n  Under the proposed robustness framework, we demonstrate efficacy of Hamming\nloss for tail-label detection in extreme classification. The equivalent\nregularized objective, in combination with proximal gradient based\noptimization, performs better than state-of-the-art methods on propensity\nscored versions of precision@k and nDCG@k(upto 20% relative improvement over\nPFastreXML - a leading tree-based approach and 60% relative improvement over\nSLEEC - a leading label-embedding approach). Furthermore, we also highlight the\nsub-optimality of a sparse solver in a widely used package for large-scale\nlinear classification, which is interesting in its own right. We also\ninvestigate the spectral properties of label graphs for providing novel\ninsights towards understanding the conditions governing the performance of\nHamming loss based one-vs-rest scheme vis-\\`a-vis label embedding methods.","url_abs":"http://arxiv.org/abs/1803.01570v1","url_pdf":"http://arxiv.org/pdf/1803.01570v1.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":"adversarial-extreme-multi-label","repo_url":"https://github.com/xmc-aalto/proxml","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"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":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.01570","atlas_url":"https://app.syntology.ai/?focus=1803.01570","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":"1803.01570"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.01570\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.01570"},"call":"get_concepts_for_paper(arxiv_id=\"1803.01570\")"}],"by_repo":[{"repo":"xmc-aalto/proxml","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":"3b558d21d8477e12e610c6d0c4c18a0afd22578f087286e8453bda62a857f29d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}