{"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/robustness-guarantees-for-bayesian-inference","title":"Robustness Guarantees for Bayesian Inference with Gaussian Processes","arxiv_id":"1809.06452","date":"2018-09-17","proceeding":null,"authors":["Luca Cardelli","Marta Kwiatkowska","Luca Laurenti","Andrea Patane"],"abstract":"Bayesian inference and Gaussian processes are widely used in applications\nranging from robotics and control to biological systems. Many of these\napplications are safety-critical and require a characterization of the\nuncertainty associated with the learning model and formal guarantees on its\npredictions. In this paper we define a robustness measure for Bayesian\ninference against input perturbations, given by the probability that, for a\ntest point and a compact set in the input space containing the test point, the\nprediction of the learning model will remain $\\delta-$close for all the points\nin the set, for $\\delta>0.$ Such measures can be used to provide formal\nguarantees for the absence of adversarial examples. By employing the theory of\nGaussian processes, we derive tight upper bounds on the resulting robustness by\nutilising the Borell-TIS inequality, and propose algorithms for their\ncomputation. We evaluate our techniques on two examples, a GP regression\nproblem and a fully-connected deep neural network, where we rely on weak\nconvergence to GPs to study adversarial examples on the MNIST dataset.","url_abs":"http://arxiv.org/abs/1809.06452v2","url_pdf":"http://arxiv.org/pdf/1809.06452v2.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":"robustness-guarantees-for-bayesian-inference","repo_url":"https://github.com/andreapatane/checkGP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.06452","atlas_url":"https://app.syntology.ai/?focus=1809.06452","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":"1809.06452"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.06452\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.06452"},"call":"get_concepts_for_paper(arxiv_id=\"1809.06452\")"}],"by_repo":[{"repo":"andreapatane/checkGP","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":"313a70e5b3ee01dddd78087fb2d73cbd25d4554395029f318122e7c97b9c8b08","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}