<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-18T17:37:25Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/335667" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/335667</identifier><datestamp>2024-12-07T23:08:47Z</datestamp><setSpec>com_1810_213729</setSpec><setSpec>com_1810_256065</setSpec><setSpec>col_1810_219485</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
   <dc:title>Iterative Monte Carlo Approximations for Bayesian Inference</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">10.17863/CAM.83098</dc:identifier>
   <dc:creator>Duffield, Samuel</dc:creator>
   <uketdterms:advisor>Singh, Sumeetpal</uketdterms:advisor>
   <dcterms:abstract>The common theme of this thesis is the concept of using Monte Carlo techniques to approximate a sequence of probability distributions. Novel methodological contributions are found in Chapter 3 through to Chapter 6. In Chapter 3 we derive a method for the complete characterisation of online statistical models where Monte Carlo approximations are defined sequentially as new data arrive. We then demonstrate the utility of this method in Chapter 4 for the compelling application of de-noising sequential GPS coordinates to be restricted to a road network. In Chapter 5 and Chapter 6, the sequence of probability distributions are defined artificially in order to gradually (and more effectively) approach a single offline target probability distribution. Chapter 5 adopts ideas from high-dimensional time series to efficiently tackle the difficult setting where we cannot evaluate the density of the target distribution and instead can only generate synthetic data. Chapter 6 explores the use of a scalable Hessian approximation in the more common scenario where the target density can be evaluated and even differentiated. Finally, Chapter 7 describes a general purpose software package that can be used to implement and customise all of the discussed algorithms at competitive speeds.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2021-09-06</dcterms:issued>
   <dc:type>Thesis</dc:type>
   <uketdterms:qualificationlevel>Doctoral</uketdterms:qualificationlevel>
   <uketdterms:qualificationname>Doctor of Philosophy (PhD)</uketdterms:qualificationname>
   <dc:language>eng</dc:language>
   <uketdterms:sponsor>EPSRC</uketdterms:sponsor>
   <dcterms:isReferencedBy xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/handle/1810/335667</dcterms:isReferencedBy>
   <dc:identifier xsi:type="dcterms:URI">https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/d3b85e71-defc-42bc-876f-987f32218734/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">fd89e1568335db8774576aa7c8b8af5d</uketdterms:checksum>
   <dc:rights>https://creativecommons.org/licenses/by-nc/4.0/</dc:rights>
   <dc:subject>Bayesian inference</dc:subject>
   <dc:subject>Monte Carlo</dc:subject>
   <dc:subject>State-space Models</dc:subject>
   <dc:subject>Statistics</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>