Mon, 09 Feb 2026

14:00 - 15:00
Lecture Room 3

TBA

Lucas Theis
Abstract

TBA

Neurodegeneration emerges at a cellular tipping point between aggregate accumulation and removal.
Cotton, M Venkatesan, S Beckwith, J Böken, D Xu, C Breiter, J Berkowicz, L Salazar, L Von Schulze, A Andrzejewska, E Brock, E Han, H Schneider, M Sahtoe, D Baker, D Rowe, J Goriely, A McEwan, W Knowles, T Lee, S Halfmann, R Klenerman, D Meisl, G bioRxiv (22 Sep 2025) https://www.ncbi.nlm.nih.gov/pubmed/41040193

We are currently inviting applications for a Postdoctoral Research Associate to work in the Mathematical Physics Group at the Mathematical Institute, University of Oxford. This is a fixed-term position for 36 months. This position is funded by the UKRI Frontier Research grant (based on an ERC Advanced Grant, Schafer-Nameki). We anticipate the start-date of this position to be no later than 1 October 2026.

Mon, 18 May 2026

16:30 - 17:30
TBC

TBC

Agnieszka Świerczewska-Gwiazda
(University of Warsaw)
Abstract

TBC

Thu, 13 Nov 2025

16:00 - 17:00
L5

Learning to Optimally Stop Diffusion Processes, with Financial Applications

Prof. Xunyu Zhou
(Columbia University (New York))
Abstract
We study optimal stopping for diffusion processes with unknown model primitives within the continuous-time reinforcement learning (RL) framework developed by Wang et al. (2020), and present applications to option pricing and portfolio choice. By penalizing the corresponding variational inequality formulation, we transform the stopping problem into a stochastic optimal control problem with two actions. We then randomize controls into Bernoulli distributions and add an entropy regularizer to encourage exploration. We derive a semi-analytical optimal Bernoulli distribution, based on which we devise RL algorithms using the martingale approach established in Jia and Zhou (2022a). We establish a policy improvement theorem and prove the fast convergence of the resulting policy iterations. We demonstrate the effectiveness of the algorithms in pricing finite-horizon American put options, solving Merton’s problem with transaction costs, and scaling to high-dimensional optimal stopping problems. In particular, we show that both the offline and online algorithms achieve high accuracy in learning the value functions and characterizing the associated free boundaries.
 
Joint work with Min Dai, Yu Sun and Zuo Quan Xu, and forthcoming in Management Science 


 

Wed, 29 Oct 2025
16:00
L6

Hard Unknot Diagrams and Arc Presentations

Sam Ketchell
(Mathematical Institute University of Oxford )
Abstract
Abstract: There exist diagrams of the unknot that are "hard" in the sense that any sequence of Reidemeister moves rearranging them into the standard unknot diagram must at some point increase the crossing number beyond what it was originally. I will discuss how such diagrams can be produced and what is known and unknown about them.
Then, I will define and discuss the arc index of a knot, an invariant that behaves more nicely than the crossing number from this perspective, and in some other ways.

If you wonder where Pete has been recently, the answer is that he has been busy setting up an AI-focused company to enable high-stakes decision making without data. And he has just raised £1.6m to kick things off.

Read more

Government got problems. Climate got problems. Energy policy got problems. We all got problems. So we need a wide range of people to hang out together to tackle them.

Subscribe to