{"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/scalable-log-determinants-for-gaussian","title":"Scalable Log Determinants for Gaussian Process Kernel Learning","arxiv_id":"1711.03481","date":"2017-11-09","proceeding":"NeurIPS 2017 12","authors":["Kun Dong","David Eriksson","Hannes Nickisch","David Bindel","Andrew Gordon Wilson"],"abstract":"For applications as varied as Bayesian neural networks, determinantal point\nprocesses, elliptical graphical models, and kernel learning for Gaussian\nprocesses (GPs), one must compute a log determinant of an $n \\times n$ positive\ndefinite matrix, and its derivatives - leading to prohibitive\n$\\mathcal{O}(n^3)$ computations. We propose novel $\\mathcal{O}(n)$ approaches\nto estimating these quantities from only fast matrix vector multiplications\n(MVMs). These stochastic approximations are based on Chebyshev, Lanczos, and\nsurrogate models, and converge quickly even for kernel matrices that have\nchallenging spectra. We leverage these approximations to develop a scalable\nGaussian process approach to kernel learning. We find that Lanczos is generally\nsuperior to Chebyshev for kernel learning, and that a surrogate approach can be\nhighly efficient and accurate with popular kernels.","url_abs":"http://arxiv.org/abs/1711.03481v1","url_pdf":"http://arxiv.org/pdf/1711.03481v1.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":"scalable-log-determinants-for-gaussian","repo_url":"https://github.com/kd383/GPML_SLD","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"scalable-log-determinants-for-gaussian","repo_url":"https://github.com/11hifish/OptSketchTraceEst","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"scalable-log-determinants-for-gaussian","repo_url":"https://github.com/ericlee0803/GP_Derivatives","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"},{"task_slug":"point-processes","task_name":"Point Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.03481","atlas_url":"https://app.syntology.ai/?focus=1711.03481","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1711.03481"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.03481\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.03481"},"call":"get_concepts_for_paper(arxiv_id=\"1711.03481\")"}],"by_repo":[{"repo":"kd383/GPML_SLD","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"11hifish/OptSketchTraceEst","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1704.07223","2111.00664"],"harvested_for_calls":[{"arxiv_id":"1704.07223","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.07223"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.07223\")"},{"arxiv_id":"2111.00664","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.00664"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.00664\")"}]},{"repo":"ericlee0803/GP_Derivatives","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"a3e7855428426b570e23fef3945ffbbcd74a823b3f8985e108ad2c37ba3b3380","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}