{"about":{"site":"https://codewithpapers.app","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.","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"},"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":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}