{"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/gadget-svm-a-gossip-based-sub-gradient-solver","title":"GADGET SVM: A Gossip-bAseD sub-GradiEnT Solver for Linear SVMs","arxiv_id":"1812.02261","date":"2018-12-05","proceeding":null,"authors":["Haimonti Dutta","Nitin Nataraj"],"abstract":"In the era of big data, an important weapon in a machine learning\nresearcher's arsenal is a scalable Support Vector Machine (SVM) algorithm. SVMs\nare extensively used for solving classification problems. Traditional\nalgorithms for learning SVMs often scale super linearly with training set size\nwhich becomes infeasible very quickly for large data sets. In recent years,\nscalable algorithms have been designed which study the primal or dual\nformulations of the problem. This often suggests a way to decompose the problem\nand facilitate development of distributed algorithms. In this paper, we present\na distributed algorithm for learning linear Support Vector Machines in the\nprimal form for binary classification called Gossip-bAseD sub-GradiEnT (GADGET)\nSVM. The algorithm is designed such that it can be executed locally on nodes of\na distributed system. Each node processes its local homogeneously partitioned\ndata and learns a primal SVM model. It then gossips with random neighbors about\nthe classifier learnt and uses this information to update the model. Extensive\ntheoretical and empirical results suggest that this anytime algorithm has\nperformance comparable to its centralized and online counterparts.","url_abs":"http://arxiv.org/abs/1812.02261v1","url_pdf":"http://arxiv.org/pdf/1812.02261v1.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":"gadget-svm-a-gossip-based-sub-gradient-solver","repo_url":"https://github.com/nitinnat/GADGET","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"svm","method_name":"SVM"}],"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":"nitinnat/GADGET","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":"39a6ef69b25a262987b51c61bfcaf15a1c61209710bbd274d452ef4b9e8b48ed","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}