{"id":{"repo_id":"cambridge","oai_identifier":"oai:www.repository.cam.ac.uk:1810/380837"},"canonical_url":"https://search.dev.ndltd.org/etd/cambridge/oai:www.repository.cam.ac.uk:1810/380837","repository":{"repo_id":"cambridge","name":"Cambridge University","base_url":"https://api.repository.cam.ac.uk/server/oai/request"},"display":{"title":"On instabilities and trust in deep learning","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Liu, Zhen Ning David"],"institution":"University of Cambridge","degree_name":"Doctor of Philosophy (PhD)","degree_level":"Doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Hansen, Anders C"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-08-31","date_published":"2024-08-31","updated_at":"2026-07-22T22:24:27Z","subjects":["Mathematics","Deep learning"],"languages":["eng"],"rights":[],"rights_urls":["https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/3b34498c-d6c9-47b5-910c-201388aeebff/download","http://purl.org/NET/rdflicense/allrightsreserved"],"identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.17863/CAM.116302","outbound_label":"DOI","outbound_source":"dc:identifier.doi"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hansen, Anders C"]},{"key":"dc:creator","label":"Author","values":["Liu, Zhen Ning David"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2024-08-31"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Cambridge"]},{"key":"dc:relation.isreferencedby.uri","label":"Dc Relation Isreferencedby URI","values":["https://www.repository.cam.ac.uk/handle/1810/380837"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Deep learning"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/3b34498c-d6c9-47b5-910c-201388aeebff/download","http://purl.org/NET/rdflicense/allrightsreserved"]},{"key":"dc:rights.embargodate","label":"Dc Rights Embargodate","values":["2026-03-04"]},{"key":"dc:rights.embargotype","label":"Dc Rights Embargotype","values":["embargo"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.17863/CAM.116302"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/acc0dc6d-79c1-4ffc-9c29-57963aca3c80/download"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format.checksum.md5","label":"Dc Format Checksum Md5","values":["87eda9de84448d1f82354d60eee3eb5f","12522b85da079725053887924063bb9b"]},{"key":"dc:title","label":"Title","values":["On instabilities and trust in deep learning"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hansen, Anders C"],"dc:creator":["Liu, Zhen Ning David"],"dc:date.issued":["2024-08-31"],"dc:description.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."],"dc:format.checksum.md5":["87eda9de84448d1f82354d60eee3eb5f","12522b85da079725053887924063bb9b"],"dc:identifier.doi":["https://doi.org/10.17863/CAM.116302"],"dc:identifier.uri":["https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/acc0dc6d-79c1-4ffc-9c29-57963aca3c80/download"],"dc:language":["eng"],"dc:publisher.institution":["University of Cambridge"],"dc:relation.isreferencedby.uri":["https://www.repository.cam.ac.uk/handle/1810/380837"],"dc:rights":["https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/3b34498c-d6c9-47b5-910c-201388aeebff/download","http://purl.org/NET/rdflicense/allrightsreserved"],"dc:rights.embargodate":["2026-03-04"],"dc:rights.embargotype":["embargo"],"dc:subject":["Mathematics","Deep learning"],"dc:title":["On instabilities and trust in deep learning"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["Doctoral"],"dc:type.qualificationname":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-07-22T22:24:27Z"}