<?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-19T20:23:38Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/393542" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/393542</identifier><datestamp>2026-01-15T01:43:04Z</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>Guiding diffusion generative models with applications to inverse problems</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">https://doi.org/10.17863/CAM.123841</dc:identifier>
   <dc:creator>Boys, Benjamin</dc:creator>
   <uketdterms:authoridentifier xsi:type="uketdterms:ORCID">0000000170782720</uketdterms:authoridentifier>
   <uketdterms:advisor>Girolami, Mark</uketdterms:advisor>
   <uketdterms:advisor>Akyildiz, Özgen Deniz</uketdterms:advisor>
   <dcterms:abstract>Conditional sampling via denoising diffusion models (DDMs) has received significant
interest in generative modelling for their scalability, improved sample quality, and versatile
application. These models are widely used in scientific and industrial settings, where they
leverage latent representations of data and complex relationships that span different data
modalities. In some of these applications, there is a known mathematical relationship
that maps latent variables to observed data, requiring the recovery of latent variables from
observed data – an inverse problem. Treating both the latent variable and the data as
realisations of random variables, we aim to sample a probability distribution that assigns a
probability to each possible solution for a latent signal x, given the observed data y, known
as the posterior, p(x|y). DDMs targeting p(x) are repurposed for solving inverse problems
by using Bayes rule as a mapping from p(x) to the posterior p(x|y). Existing approaches,
known as guidance methods, use Gaussian approximations to the conditional densities via
Tweedie’s formula to parameterise the mean, and are complemented by various heuristics.
We make two contributions to the improvement of methodology for solving inverse
problems via the use of generative priors. The first contribution is to address challenges
from these approximations by incorporating higher-order information via Tweedie’s formula
for a statistically principled approximation. We present a theoretical guarantee specific to
posterior sampling. This contributes to a deeper theoretical understanding of diffusion-guided
sampling. We demonstrate the empirical effectiveness of our method on general linear inverse
problems, using both synthetic examples and image restoration tasks.
In our second contribution, we investigate a novel application of conditional generation
in construction planning services, in collaboration with our industry partner, nPlan. Using
DDMs, we leverage text data from construction project schedules to estimate activity durations
within a schedule generation pipeline. Additionally, we quantify risk by applying
statistical regression models to predict construction activity delays. Transforming delay
prediction into an ordinal regression task, we compare the performance of a Multilayer
Perceptron (MLP) model with that of Gaussian Processes. Our findings suggest that the
MLP model is better suited for this task, highlighting potential for future work on delay
distribution modeling.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2025-01-29</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>
   <dcterms:isReferencedBy xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/handle/1810/393542</dcterms:isReferencedBy>
   <dc:identifier xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/bitstreams/ef78490b-280b-4a95-90a6-19f7dc961830/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">1a4e2826eb4b3e0d7e247c0da870b5ba</uketdterms:checksum>
   <dcterms:license>https://www.repository.cam.ac.uk/bitstreams/bad767a3-f995-4dc3-8ab6-d61200131175/download</dcterms:license>
   <uketdterms:checksum xsi:type="uketdterms:MD5">87eda9de84448d1f82354d60eee3eb5f</uketdterms:checksum>
   <dc:rights>http://purl.org/NET/rdflicense/allrightsreserved</dc:rights>
   <dc:subject>AI</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>