{"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/ds-mlr-exploiting-double-separability-for","title":"DS-MLR: Exploiting Double Separability for Scaling up Distributed Multinomial Logistic Regression","arxiv_id":"1604.04706","date":"2016-04-16","proceeding":null,"authors":["Parameswaran Raman","Sriram Srinivasan","Shin Matsushima","Xinhua Zhang","Hyokun Yun","S. V. N. Vishwanathan"],"abstract":"Scaling multinomial logistic regression to datasets with very large number of\ndata points and classes is challenging. This is primarily because one needs to\ncompute the log-partition function on every data point. This makes distributing\nthe computation hard. In this paper, we present a distributed stochastic\ngradient descent based optimization method (DS-MLR) for scaling up multinomial\nlogistic regression problems to massive scale datasets without hitting any\nstorage constraints on the data and model parameters. Our algorithm exploits\ndouble-separability, an attractive property that allows us to achieve both data\nas well as model parallelism simultaneously. In addition, we introduce a\nnon-blocking and asynchronous variant of our algorithm that avoids\nbulk-synchronization. We demonstrate the versatility of DS-MLR to various\nscenarios in data and model parallelism, through an extensive empirical study\nusing several real-world datasets. In particular, we demonstrate the\nscalability of DS-MLR by solving an extreme multi-class classification problem\non the Reddit dataset (159 GB data, 358 GB parameters) where, to the best of\nour knowledge, no other existing methods apply.","url_abs":"http://arxiv.org/abs/1604.04706v7","url_pdf":"http://arxiv.org/pdf/1604.04706v7.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":"ds-mlr-exploiting-double-separability-for","repo_url":"https://bitbucket.org/params/dsmlr","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"blocking","task_name":"Blocking"},{"task_slug":"multi-class-classification","task_name":"Multi-class Classification"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"bitbucket.org/params/dsmlr","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":"d33a708657838b2fce728859c100cd1b64a52473213192d09234299a5256711c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}