{"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/approximation-vector-machines-for-large-scale","title":"Approximation Vector Machines for Large-scale Online Learning","arxiv_id":"1604.06518","date":"2016-04-22","proceeding":null,"authors":["Trung Le","Tu Dinh Nguyen","Vu Nguyen","Dinh Phung"],"abstract":"One of the most challenging problems in kernel online learning is to bound\nthe model size and to promote the model sparsity. Sparse models not only\nimprove computation and memory usage, but also enhance the generalization\ncapacity, a principle that concurs with the law of parsimony. However,\ninappropriate sparsity modeling may also significantly degrade the performance.\nIn this paper, we propose Approximation Vector Machine (AVM), a model that can\nsimultaneously encourage the sparsity and safeguard its risk in compromising\nthe performance. When an incoming instance arrives, we approximate this\ninstance by one of its neighbors whose distance to it is less than a predefined\nthreshold. Our key intuition is that since the newly seen instance is expressed\nby its nearby neighbor the optimal performance can be analytically formulated\nand maintained. We develop theoretical foundations to support this intuition\nand further establish an analysis to characterize the gap between the\napproximation and optimal solutions. This gap crucially depends on the\nfrequency of approximation and the predefined threshold. We perform the\nconvergence analysis for a wide spectrum of loss functions including Hinge,\nsmooth Hinge, and Logistic for classification task, and $l_1$, $l_2$, and\n$\\epsilon$-insensitive for regression task. We conducted extensive experiments\nfor classification task in batch and online modes, and regression task in\nonline mode over several benchmark datasets. The results show that our proposed\nAVM achieved a comparable predictive performance with current state-of-the-art\nmethods while simultaneously achieving significant computational speed-up due\nto the ability of the proposed AVM in maintaining the model size.","url_abs":"http://arxiv.org/abs/1604.06518v4","url_pdf":"http://arxiv.org/pdf/1604.06518v4.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":"approximation-vector-machines-for-large-scale","repo_url":"https://github.com/tund/avm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"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":"tund/avm","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":"f88c0521aadf2b195865a7e5cc05dc0211aa78bc12aab68ca8030591b40f3b72","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}