{"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/engineering-fast-multilevel-support-vector","title":"Engineering fast multilevel support vector machines","arxiv_id":"1707.07657","date":"2017-07-24","proceeding":null,"authors":["E. Sadrfaridpour","T. Razzaghi","I. Safro"],"abstract":"The computational complexity of solving nonlinear support vector machine\n(SVM) is prohibitive on large-scale data. In particular, this issue becomes\nvery sensitive when the data represents additional difficulties such as highly\nimbalanced class sizes. Typically, nonlinear kernels produce significantly\nhigher classification quality to linear kernels but introduce extra kernel and\nmodel parameters which requires computationally expensive fitting. This\nincreases the quality but also reduces the performance dramatically. We\nintroduce a generalized fast multilevel framework for regular and weighted SVM\nand discuss several versions of its algorithmic components that lead to a good\ntrade-off between quality and time. Our framework is implemented using PETSc\nwhich allows an easy integration with scientific computing tasks. The\nexperimental results demonstrate significant speed up compared to the\nstate-of-the-art nonlinear SVM libraries.\n  Reproducibility: our source code, documentation and parameters are available\nat https:// github.com/esadr/mlsvm.","url_abs":"http://arxiv.org/abs/1707.07657v3","url_pdf":"http://arxiv.org/pdf/1707.07657v3.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":"engineering-fast-multilevel-support-vector","repo_url":"https://github.com/esadr/mlsvm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"},{"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":"esadr/mlsvm","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":"2a69f6476c659db57cb273b57f542af3e5cc72e2e4af4b3f875ed81058f62a67","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}