Statistics, Probability, Analysis and Applied Mathematics (SPAAM)
SPAAM Seminar Series 2024/25
The Statistics, Probability, Analysis and Applied Mathematics (SPAAM) seminar series will take place on Thursdays between 3-4pm in room B3.02 and virtually on the SPAAM Microsoft Teams ChannelLink opens in a new window during term time. It will host a variety of talks from PhD students involved in applied mathematics research at Warwick and invited guests from other institutions (see below for the schedule and talk abstracts).
The seminars will usually host two speakers (unless otherwise stated) with each talk taking around 15-20 minutes with 5-10 minutes of questions afterwards. Speakers and committee members will hang around after the talks for social tea/coffee (and cakes!) and further questions.
This seminar series is hosted by the Warwick SIAM-IMA Student ChapterLink opens in a new window. Please do contact one of the committee members if you would like to join and be added to the MS Teams channel. Note that these talks may be recorded so do join with audio and video off if you don't wish to feature!
If you missed the seminar, head over to our YouTube channelLink opens in a new window to find the recorded talks!
If you would like to give a talk this academic year, please contact one of our seminar organisers:
Mark Lynch (Link opens in a new window) or
Luisa Fernanda Estrada Plata (Link opens in a new window) or
Sotirios Stamnas (Link opens in a new window)
and we will find you a slot!
Find out more about the
Warwick SIAM-IMA Student Chapter
Term 1
Date |
Talk 1 |
Talk 2 |
---|---|---|
10th October 2024 (Week 2) |
Social Event - Board Games | |
17th October 2024 (Week 3) | Andrew Nugent (Heterogeneous mean-field limits: when different is actually the same) |
Aria Ahari (Boundary crossing problems and functional transformations for Ornstein–Uhlenbeck processes) |
24th October 2024 (Week 4) |
Grega Saksida (Random walks in spin systems) |
Joseph Duque Lopez |
31st October 2024 (Week 5) |
Social Event | |
7th November 2024 (Week 6) |
Kipp Freud (AutoVec: Automatic generation of data and vector embeddings for arbitrary domains and cross-domain mappings using LLMs) |
Max Butler (Kernel Methods for SDE Parameter Inference) |
14th November 2024 (Week 7) |
Byron Tzamarias |
Luisa Estrada (PAC Learning Social Networks Via Threshold-Based Opinion Dynamics) |
21st November 2024 (Week 8) |
Chen Lyu (Faithfulness and Factuality in NLP) |
Mark Lynch (Modelling the Role of Empathy in Epidemic Spread) |
28th November 2024 (Week 9) |
Social Event | |
5th December 2024 (Week 10) | Benedict Russell | Matt Bowditch |
Term 1 Abstracts
Week 8. Chen Lyu (Computer Science, Warwick) | Faithfulness and Factuality in NLP
Faithfulness and factuality are essential for ensuring the reliability and trustworthiness of Natural Language Processing (NLP) systems, particularly in high-stakes domains like healthcare, law, and education. This talk explores these intertwined concepts, focusing on the challenges of maintaining alignment between generated text and source content (faithfulness) and ensuring accuracy against real-world facts (factuality). While large language models (LLMs) bring unprecedented capabilities, they often introduce hallucinations and inconsistencies that undermine trust. This presentation will cover state-of-the-art techniques, including entailment-based methods, chain-of-thought reasoning, and external knowledge integration, alongside their applications in summarization, question answering, and domain-specific tasks. By examining case studies and current benchmarks, the talk provides insights into building NLP systems that prioritize both faithfulness and factuality for more reliable outputs.
Week 8. Mark Lynch (MathSys, Warwick) | Modelling the Role of Empathy in Epidemic Spread
Human behaviour is a key contributor to the spread of an infectious disease. People typically do not want to infect others if they themselves are infected. How empathetic does a population need to be in order to rationally suppress a disease through social distancing? When is this possible if the disease is asymptomatic? This population behaviour can be viewed as a “differential game”: Rational, well informed individuals seek to maximise their own utility function by modifying their behaviour. When the costs in the utility only pertain to the individual, infected individuals never socially distance because modifying their behaviour cannot improve their situation. We study the case where individuals care about other members of the population, in order to protect others from incurring the cost of being infected and/or of having to socially distance. We quantify the degree to which individuals must care about the population in order to rationally target disease eradication through social distancing. This work is then extended to an asymptomatic case, where susceptible behaviour is performed by a subset of infected individuals.
Week 7. Byron Tzamarias (MathSys, Warwick)
Week 7. Luisa Estrada (MathSys, Warwick) | PAC Learning Social Networks Via Threshold-Based Opinion Dynamics
Agents in social networks adopt opinions through threshold-based dynamics when enough of their influencers support a particular opinion. Most existing models, however, assume perfect information with fully known network structure and dynamics. We drop this often unrealistic assumption, allowing a learner to observe only the agents’ opinion updates. From there, we address the problem of inferring a network structure consistent with a random sample of observations, aiming to establish tractable PAC learning bounds. Our approach involves designing consistent hypothesis finders that run in polynomial time for both unanimous dynamics and the all-but-k threshold rules, where k influencers can inhibit an opinion change. For majority dynamics, we prove NP-hardness via a reduction from the Hitting Set Problem. In response, we developed a polynomial-time heuristic that successfully identified a consistent network with majority dynamics in over 97% of our computer-aided simulations, with even higher accuracy for inputs with skewed dimensions.
Week 6. Kipp Freud (University of Bristol) | AutoVec: Automatic generation of data and vector embeddings for arbitrary domains and cross-domain mappings using LLMs
We present AutoVec, a novel method for the fully unsupervised construction of interpretable embedding spaces applicable to arbitrary domains. Our approach automates costly data acquisition by leveraging the knowledge embedded in large language models (LLMs), facilitating similarity assessments between entities for meaningful positioning within vector spaces. Additionally, our method enables intelligent mappings between vector space representations of disparate domains, using a novel form of cross-domain similarity analysis. AutoVec is both a valuable tool for data synthesis, and facilitates a novel form of recommendation system; we can recommend entities from one domain based on entities from other domains. What movie should I watch if I enjoy the book Red Rising? What song should I listen to while I play the board game Risk? If King Charles was a vegetable, what vegetable would he be? Finally, such questions can be answered with AutoVec.
Week 6. Max Butler (MathSys, Warwick) | Kernel Methods for SDE Parameter Inference
Stochastic Differential Equations (SDEs) are being increasingly used in many Scientific disciplines to model real-world phenomena. SDEs allow practitioners to utilise their understanding of the deterministic dynamics or trends while also capturing, stochastically, the elements that are not yet understood or are not yet measurable. Once a SDE model has been devised it has to be fit to the observed data, exact analytical inference is often not possible especially with models that capture non-linear dynamics, meaning simulation based or approximate numerical methods must be used. Simulation based methods have the problem that doing the large amount of simulation required is computationally expensive and many approximate numerical methods don’t capture the full law the distribution. In this talk I'll present a novel method of SDE inference that combines the speed of approximate numerical methods with the accuracy of more expensive simulation based methods.
Week 4. Grega Saksida (Warwick Maths CDT) | Random walks in spin systems.
Spin systems, a very active topic in statistical mechanics, are models that describe how spin particles behave and interact with each other. A common question in this field is whether, and at what temperature, does a material transition between a "normal" and a magnetic state. One can usually represent objects in spin systems in terms of random walks, which allows us to apply techniques of random walks on spin systems. In this talk, I will first define a typical object we study in statistical mechanics: a two-point function. This can be studied using a technique called lace expansion. I will give an outline of the technique, using a self-avoiding walk as an example.Week 4. Joseph Duque Lopez (HetSys, Warwick)
Atomistic simulations using Density Functional Theory can only capture femtoseconds worth of data within a limited simulation cell size. In order to predict the long-term effects of irradiation on the material properties of Tungsten, we require a continuum approach to simulate the interactions of dislocation loops in Tungsten due to irradiation. Contemporary continuum models of stress fields from dislocation loops are tricky to handle due to the presence of singularities near the core of the dislocations. We present a method to regularise such models while producing accurate predictions for the far-field interactions between loops. Such models must be informed by lower length scale simulations so that the physics of the problem is correctly captured by the model, therefore verification via atomistic simulations is still important to perform. We present the current model and its advantages, and how it compares against predictions produced by atomistic simulations, particularly how the decay rate of atomic displacements scale in the continuum and atomistic simulations.
Week 3. Andrew Nugent (MathSys, Warwick) | Heterogeneous mean-field limits: when different is actually the same.
When studying large systems of interacting particles, such as in opinion formation, bird flocking or pedestrian dynamics, it can be useful to consider the limit as the population becomes infinitely large. This 'mean-field limit' provides a single partial differential equation describing the density of opinions/birds/pedestrians, thus avoiding tracking a large number of individuals. However, an additional challenge arises when the population is heterogeneous, such as when interactions occur over a network rather than in a well-mixed population. Inspired by the works of Pierre-Emmanuel Jabin and Fabio Coppini, this talk will discuss the use of heterogeneous mean-field limits, using their application to opinion dynamics on networks as a running example. We will examine when the heterogeneous mean-field limit differs from the 'classical' one and, perhaps most interestingly, when it does not.