{"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/fast-prediction-with-svm-models-containing","title":"Fast Prediction with SVM Models Containing RBF Kernels","arxiv_id":"1403.0736","date":"2014-03-04","proceeding":null,"authors":["Marc Claesen","Frank De Smet","Johan A. K. Suykens","Bart De Moor"],"abstract":"We present an approximation scheme for support vector machine models that use\nan RBF kernel. A second-order Maclaurin series approximation is used for\nexponentials of inner products between support vectors and test instances. The\napproximation is applicable to all kernel methods featuring sums of kernel\nevaluations and makes no assumptions regarding data normalization. The\nprediction speed of approximated models no longer relates to the amount of\nsupport vectors but is quadratic in terms of the number of input dimensions. If\nthe number of input dimensions is small compared to the amount of support\nvectors, the approximated model is significantly faster in prediction and has a\nsmaller memory footprint. An optimized C++ implementation was made to assess\nthe gain in prediction speed in a set of practical tests. We additionally\nprovide a method to verify the approximation accuracy, prior to training models\nor during run-time, to ensure the loss in accuracy remains acceptable and\nwithin known bounds.","url_abs":"http://arxiv.org/abs/1403.0736v3","url_pdf":"http://arxiv.org/pdf/1403.0736v3.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":"fast-prediction-with-svm-models-containing","repo_url":"https://github.com/claesenm/approxsvm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"prediction","task_name":"Prediction"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"claesenm/approxsvm","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":"0ad15adb69ec2dda16337a268efb9067646114f257bc53bbf76083be493f7879","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}