{"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/learning-the-kernel-matrix-via-predictive-low","title":"Learning the kernel matrix via predictive low-rank approximations","arxiv_id":"1601.04366","date":"2016-01-17","proceeding":null,"authors":["Martin Stražar","Tomaž Curk"],"abstract":"Efficient and accurate low-rank approximations of multiple data sources are\nessential in the era of big data. The scaling of kernel-based learning\nalgorithms to large datasets is limited by the O(n^2) computation and storage\ncomplexity of the full kernel matrix, which is required by most of the recent\nkernel learning algorithms.\n  We present the Mklaren algorithm to approximate multiple kernel matrices\nlearn a regression model, which is entirely based on geometrical concepts. The\nalgorithm does not require access to full kernel matrices yet it accounts for\nthe correlations between all kernels. It uses Incomplete Cholesky\ndecomposition, where pivot selection is based on least-angle regression in the\ncombined, low-dimensional feature space. The algorithm has linear complexity in\nthe number of data points and kernels. When explicit feature space induced by\nthe kernel can be constructed, a mapping from the dual to the primal Ridge\nregression weights is used for model interpretation.\n  The Mklaren algorithm was tested on eight standard regression datasets. It\noutperforms contemporary kernel matrix approximation approaches when learning\nwith multiple kernels. It identifies relevant kernels, achieving highest\nexplained variance than other multiple kernel learning methods for the same\nnumber of iterations. Test accuracy, equivalent to the one using full kernel\nmatrices, was achieved with at significantly lower approximation ranks. A\ndifference in run times of two orders of magnitude was observed when either the\nnumber of samples or kernels exceeds 3000.","url_abs":"http://arxiv.org/abs/1601.04366v2","url_pdf":"http://arxiv.org/pdf/1601.04366v2.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":"learning-the-kernel-matrix-via-predictive-low","repo_url":"https://github.com/mstrazar/mklaren","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"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":"mstrazar/mklaren","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":"c2add03facb2ee0e51bb00cb7b10fc42fecf937d0d7010dca0cd2f347a3c02f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}