<?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-11-21T02:18:02Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/32482" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/32482</identifier><datestamp>2026-09-24T02:40:10Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Kratsios, Anastasis</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Arabpour Dahoei, Reza</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computational Engineering and Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-10-02T16:16:51Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-10-02T16:16:51Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2025-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/32482</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/20013</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This thesis presents two significant research contributions: one focuses on improving the adaptation of large language models (LLMs) using parameter-efficient fine-tuning (PEFT), and the other addresses the effective modelling of history-dependent stochastic processes—specifically Volterra processes, which are commonly applied in quantitative finance.&#xd;
&#xd;
In the first part, I introduce a user-friendly adaptation pipeline that boosts the performance of a standard foundation model, bringing it much closer to a fully fine-tuned, task-specific version. Remarkably, it achieves this while using significantly less compute and memory, all while keeping data private. The pipeline leverages existing learnable low-rank adapters (LoRA) for known datasets and predicts adapter values for new datasets using this readily available information. Its main advantage is that it can run on a standard laptop without requiring GPU power, ensuring that data remains local. This method effectively closes about half of the performance gap between an untuned base model and a fully fine-tuned one, making specialized models more accessible to researchers, practitioners, and everyday users who lack expensive infrastructure or work with sensitive data on devices like smartphones.&#xd;
&#xd;
The second part addresses a computational challenge in translating the non-Markovian Volterra process into a format suitable for computation. This translation is difficult because the data history dimension affecting the current state grows with the length of the path. I propose a two-step approach to make this process manageable: first, the Volterra process is mapped onto a simpler, lower-dimensional manifold; then, a geometric deep learning model—a "hypernetwork"—is applied, specifically designed for the manifold’s structure. We provide both mathematical and computational evidence demonstrating the model’s effectiveness and practicality (with proofs developed by co-authors available in the main paper), along with extensive testing of each parameter to validate our approach.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="layabstract" lang="en_US">This thesis presents two contributions at the intersection of artificial intelligence and mathematics.&#xd;
&#xd;
First, I introduce a novel method for adapting large language models on widely available hardware. This approach recovers half of the performance lost when using an untuned base model instead of a GPU fine-tuned one, while running on a single laptop with minimal cost and energy consumption. It makes specialized models more accessible, preserves privacy by keeping data local, and promotes environmentally responsible computing.&#xd;
&#xd;
Second, I develop a practical framework for working with history-dependent stochastic processes commonly used in quantitative finance. Such processes are often too large to compute efficiently. The method proposed here compresses them into a low-dimensional representation and then applies a computational model, enabling efficient simulation, estimation, and practical application.&#xd;
&#xd;
Together, these contributions introduce novel algorithms capable of addressing real-world problems from fresh perspectives.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Machine Learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Deep Learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Geometric Deep Learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Financial Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Time Series</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Financial Time Series</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Foundation Models</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Large Language Models</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">LLMs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Hypernetworks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Artificial Intelligence</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Geometric Deep Learning For Financial Time Series and Efficient Fine-Tuning of Foundation Models</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Geometric Deep Learning for Time Series and Foundation Models</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>