<?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-24T01:49:03Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/380837" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/380837</identifier><datestamp>2025-03-05T01:43:50Z</datestamp><setSpec>com_1810_205871</setSpec><setSpec>com_1810_256064</setSpec><setSpec>col_1810_206446</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>On instabilities and trust in deep learning</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">https://doi.org/10.17863/CAM.116302</dc:identifier>
   <dc:creator>Liu, Zhen Ning David</dc:creator>
   <uketdterms:advisor>Hansen, Anders C</uketdterms:advisor>
   <dcterms:abstract>Artificial Intelligence (AI) has become an integral part of daily life, influencing everything from
search engines and voice assistants to medical diagnostics and self-driving cars. Recent advancements in large language models (LLMs) have brought AI closer to mimicking human-like
text generation, raising discussions about AI’s potential to pass the Turing Test. Despite these
successes, AI systems remain fragile, prone to hallucinations and adversarial examples, which
expose the vulnerabilities in their decision-making processes. This thesis explores foundational
issues in AI, particularly LLMs and neural networks, through the lens of computability theory
and stability analysis.
Chapter 1 provides relevant background material, outlining the motivation, objectives, and
contributions of the research. The chapter introduces the key concepts of randomness, stability,
and uncertainty in AI and highlights the importance of understanding these aspects to improve
the reliability and robustness of AI systems.
Chapter 2 investigates the phenomenon of hallucinations in LLMs and addresses the
question of whether randomness in LLMs can solve non-computable problems. By drawing
on established work on random Turing Machines, this chapter explores the implications of
randomness on LLMs, particularly in the context of multivalued problems.
In Chapter 3, the focus shifts to adversarial examples in neural networks, which occur when
small perturbations in input data cause significant output changes. While traditional efforts
have aimed to mitigate this by reducing the Lipschitz constant, classification tasks’ inherent
discontinuity challenges these approaches. This chapter introduces a novel stability measure
for classification tasks and presents two approximation theorems that link stability to neural
networks’ ability to approximate discontinuous functions.
Chapter 4 examines the feasibility of learning uncertainty estimates for models, focusing
on the potential to develop methods that help neural networks gauge their own confidence. The
chapter introduces ‘shadow properties’, a type of vulnerability that exists in models due to the
geometry of the parameter space, and demonstrates how these properties impact a model’s
ability to estimate certainty. Analytical and numerical results are provided to highlight the
relationship between model parameters and shadow properties.
This thesis provides a theoretical framework for understanding the limitations of AI, focusing on random algorithms, stability in neural networks, and the learnability of uncertainty
estimates.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2024-08-31</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/380837</dcterms:isReferencedBy>
   <uketdterms:embargotype>embargo</uketdterms:embargotype>
   <uketdterms:embargodate>2026-03-04</uketdterms:embargodate>
   <dcterms:license>https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/3b34498c-d6c9-47b5-910c-201388aeebff/download</dcterms:license>
   <uketdterms:checksum xsi:type="uketdterms:MD5">87eda9de84448d1f82354d60eee3eb5f</uketdterms:checksum>
   <dc:identifier xsi:type="dcterms:URI">https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/acc0dc6d-79c1-4ffc-9c29-57963aca3c80/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">12522b85da079725053887924063bb9b</uketdterms:checksum>
   <dc:rights>http://purl.org/NET/rdflicense/allrightsreserved</dc:rights>
   <dc:subject>Mathematics</dc:subject>
   <dc:subject>Deep learning</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>