{"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/deep-gaussian-processes-for-multi-fidelity","title":"Deep Gaussian Processes for Multi-fidelity Modeling","arxiv_id":"1903.07320","date":"2019-03-18","proceeding":null,"authors":["Kurt Cutajar","Mark Pullin","Andreas Damianou","Neil Lawrence","Javier González"],"abstract":"Multi-fidelity methods are prominently used when cheaply-obtained, but\npossibly biased and noisy, observations must be effectively combined with\nlimited or expensive true data in order to construct reliable models. This\narises in both fundamental machine learning procedures such as Bayesian\noptimization, as well as more practical science and engineering applications.\nIn this paper we develop a novel multi-fidelity model which treats layers of a\ndeep Gaussian process as fidelity levels, and uses a variational inference\nscheme to propagate uncertainty across them. This allows for capturing\nnonlinear correlations between fidelities with lower risk of overfitting than\nexisting methods exploiting compositional structure, which are conversely\nburdened by structural assumptions and constraints. We show that the proposed\napproach makes substantial improvements in quantifying and propagating\nuncertainty in multi-fidelity set-ups, which in turn improves their\neffectiveness in decision making pipelines.","url_abs":"http://arxiv.org/abs/1903.07320v1","url_pdf":"http://arxiv.org/pdf/1903.07320v1.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":"deep-gaussian-processes-for-multi-fidelity","repo_url":"https://github.com/luck1226/multisource_deepGaussianProcess","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.07320","atlas_url":"https://app.syntology.ai/?focus=1903.07320","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":"1903.07320"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.07320\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.07320"},"call":"get_concepts_for_paper(arxiv_id=\"1903.07320\")"}],"by_repo":[{"repo":"luck1226/multisource_deepGaussianProcess","kind":"listed","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":"371785f8f5d2fd566e2911bfabf448d7bb2a9697ee6a7d54affb34f898e61387","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}