{"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/eigengp-gaussian-process-models-with-adaptive","title":"EigenGP: Gaussian Process Models with Adaptive Eigenfunctions","arxiv_id":"1401.0362","date":"2014-01-02","proceeding":null,"authors":["Hao Peng","Yuan Qi"],"abstract":"Gaussian processes (GPs) provide a nonparametric representation of functions.\nHowever, classical GP inference suffers from high computational cost for big\ndata. In this paper, we propose a new Bayesian approach, EigenGP, that learns\nboth basis dictionary elements--eigenfunctions of a GP prior--and prior\nprecisions in a sparse finite model. It is well known that, among all\northogonal basis functions, eigenfunctions can provide the most compact\nrepresentation. Unlike other sparse Bayesian finite models where the basis\nfunction has a fixed form, our eigenfunctions live in a reproducing kernel\nHilbert space as a finite linear combination of kernel functions. We learn the\ndictionary elements--eigenfunctions--and the prior precisions over these\nelements as well as all the other hyperparameters from data by maximizing the\nmodel marginal likelihood. We explore computational linear algebra to simplify\nthe gradient computation significantly. Our experimental results demonstrate\nimproved predictive performance of EigenGP over alternative sparse GP methods\nas well as relevance vector machine.","url_abs":"http://arxiv.org/abs/1401.0362v3","url_pdf":"http://arxiv.org/pdf/1401.0362v3.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":"eigengp-gaussian-process-models-with-adaptive","repo_url":"https://github.com/hao-peng/EigenGP","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"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":"hao-peng/EigenGP","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":"14ccf7dac7b1e709e317886adc9a25c7abd117ad0be51743ac3b33f3cc432657","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}