{"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/bayesian-optimisation-for-fast-approximate","title":"Bayesian optimisation for fast approximate inference in state-space models with intractable likelihoods","arxiv_id":"1506.06975","date":"2015-06-23","proceeding":null,"authors":["Johan Dahlin","Mattias Villani","Thomas B. Schön"],"abstract":"We consider the problem of approximate Bayesian parameter inference in\nnon-linear state-space models with intractable likelihoods. Sequential Monte\nCarlo with approximate Bayesian computations (SMC-ABC) is one approach to\napproximate the likelihood in this type of models. However, such approximations\ncan be noisy and computationally costly which hinders efficient implementations\nusing standard methods based on optimisation and Monte Carlo methods. We\npropose a computationally efficient novel method based on the combination of\nGaussian process optimisation and SMC-ABC to create a Laplace approximation of\nthe intractable posterior. We exemplify the proposed algorithm for inference in\nstochastic volatility models with both synthetic and real-world data as well as\nfor estimating the Value-at-Risk for two portfolios using a copula model. We\ndocument speed-ups of between one and two orders of magnitude compared to\nstate-of-the-art algorithms for posterior inference.","url_abs":"http://arxiv.org/abs/1506.06975v3","url_pdf":"http://arxiv.org/pdf/1506.06975v3.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":"bayesian-optimisation-for-fast-approximate","repo_url":"https://github.com/compops/gpo-abc2015","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"bayesian-optimisation-for-fast-approximate","repo_url":"https://github.com/compops/gpo-smc-abc","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-optimisation","task_name":"Bayesian Optimisation"},{"task_slug":"state-space-models","task_name":"State Space Models"}],"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":"compops/gpo-abc2015","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"compops/gpo-smc-abc","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":"9f4681b4a041074b184ebe57c57b4c2631fceb3cf1eb83a6a6cbec56358f5678","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}