Mon, 09 Feb 2026

14:00 - 15:00
Lecture Room 3

What makes an image realistic ?

Lucas Theis
Abstract

The last decade has seen tremendous progress in our ability to generate realistic-looking data, be it images, text, audio, or video. In this presentation, we will look at the closely related problem of quantifying realism, that is, designing functions that can reliably tell realistic data from unrealistic data. This problem turns out to be significantly harder to solve and remains poorly understood, despite its prevalence in machine learning and recent breakthroughs in generative AI. Drawing on insights from algorithmic information theory, we discuss why this problem is challenging, why a good generative model alone is insufficient to solve it, and what a good solution would look like. In particular, we introduce the notion of a universal critic, which unlike adversarial critics does not require adversarial training. While universal critics are not immediately practical, they can serve both as a North Star for guiding practical implementations and as a tool for analyzing existing attempts to capture realism.

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 2025.09.08.674880 (12 Sep 2025)

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

Mon, 18 May 2026

16:30 - 17:30
TBC

TBA

Prof. Agnieszka Świerczewska-Gwiazda
(University of Warsaw)
Abstract

TBA

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 


 

Measurement of the mean number of muons with energies above 500 GeV in air showers detected with the IceCube Neutrino Observatory
Abbasi, R Ackermann, M Adams, J Agarwalla, S Aguilar, J Ahlers, M Alameddine, J Amin, N Andeen, K Argüelles, C Ashida, Y Athanasiadou, S Axani, S Babu, R Bai, X Baines-Holmes, J V., A Barwick, S Bash, S Basu, V Bay, R Beatty, J Tjus, J Behrens, P Beise, J Bellenghi, C Benkel, B BenZvi, S Berley, D Bernardini, E Besson, D Blaufuss, E Bloom, L Blot, S Bodo, I Bontempo, F Motzkin, J Meneguolo, C Böser, S Botner, O Böttcher, J Braun, J Brinson, B Brisson-Tsavoussis, Z Burley, R Butterfield, D Campana, M Carloni, K Carpio, J Chattopadhyay, S Chau, N Chen, Z Chirkin, D Choi, S Clark, B Coleman, A Coleman, P Collin, G Connolly, A Conrad, J Corley, R Cowen, D De Clercq, C DeLaunay, J Delgado, D Delmeulle, T Deng, S Desiati, P de Vries, K de Wasseige, G DeYoung, T Díaz-Vélez, J DiKerby, S Dittmer, M Domi, A Draper, L Dueser, L Durnford, D Dutta, K DuVernois, M Ehrhardt, T Eidenschink, L Eimer, A Eller, P Ellinger, E Elsässer, D Engel, R Erpenbeck, H Esmail, W Eulig, S Evans, J Evenson, P Fan, K Fang, K Farrag, K Fazely, A Fedynitch, A Feigl, N Finley, C Fischer, L Fox, D Franckowiak, A Fukami, S Fürst, P Gallagher, J Ganster, E Garcia, A Garcia, M Garg, G Genton, E Gerhardt, L Ghadimi, A Glaser, C Glüsenkamp, T Gonzalez, J Goswami, S Granados, A Grant, D Gray, S Griffin, S Griswold, S Groth, K Guevel, D Günther, C Gutjahr, P Ha, C Haack, C Hallgren, A Halve, L Halzen, F Hamacher, L Minh, M Handt, M Hanson, K Hardin, J Harnisch, A Hatch, P Haungs, A Häußler, J Helbing, K Hellrung, J Hennig, L Heuermann, L Hewett, R Heyer, N Hickford, S Hidvegi, A Hill, C Hill, G Hmaid, R Hoffman, K Hooper, D Hori, S Hoshina, K Hostert, M Hou, W Huber, T Hultqvist, K Hymon, K Ishihara, A Iwakiri, W Jacquart, M Jain, S Janik, O Jeong, M Jin, M Kamp, N Kang, D Kang, X Kappes, A Kardum, L Karg, T Karl, M Karle, A Katil, A Kauer, M Kelley, J Khanal, M Zathul, A Kheirandish, A Kimku, H Kiryluk, J Klein, C Klein, S Kobayashi, Y Kochocki, A Koirala, R Kolanoski, H Kontrimas, T Köpke, L Kopper, C Koskinen, D Koundal, P Kowalski, M Kozynets, T Krieger, N Krishnamoorthi, J Krishnan, T Kruiswijk, K Krupczak, E Kumar, A Kun, E Kurahashi, N Lad, N Gualda, C Arnaud, L Lamoureux, M Larson, M Lauber, F Lazar, J DeHolton, K Leszczyńska, A Liao, J Liu, Y Liubarska, M Love, C Lu, L Lucarelli, F Luszczak, W Lyu, Y Madsen, J Magnus, E Mahn, K Makino, Y Manao, E Mancina, S Mand, A Mariş, I Marka, S Marka, Z Marten, L Martinez-Soler, I Maruyama, R Mayhew, F McNally, F Mead, J Meagher, K Mechbal, S Medina, A Meier, M Merckx, Y Merten, L Mitchell, J Molchany, L Montaruli, T Moore, R Morii, Y Mosbrugger, A Moulai, M Mousadi, D Mukherjee, T Naab, R Nakos, M Naumann, U Necker, J Neste, L Neumann, M Niederhausen, H Nisa, M Noda, K Noell, A Novikov, A Pollmann, A O’Dell, V Olivas, A Orsoe, R Osborn, J O’Sullivan, E Palusova, V Pandya, H Parenti, A Park, N Parrish, V Paudel, E Paul, L de los Heros, C Pernice, T Peterson, J Plum, M Pontén, A Poojyam, V Popovych, Y Rodriguez, M Pries, B Procter-Murphy, R Przybylski, G Pyras, L Raab, C Rack-Helleis, J Rad, N Ravn, M Rawlins, K Rechav, Z Rehman, A Reistroffer, I Resconi, E Reusch, S Rho, C Rhode, W Riedel, B Rifaie, A Roberts, E Robertson, S Rongen, M Rosted, A Rott, C Ruhe, T Ruohan, L Saffer, J Salazar-Gallegos, D Sampathkumar, P Sandrock, A Sanger-Johnson, G Santander, M Sarkar, S Savelberg, J Schaile, P Schaufel, M Schieler, H Schindler, S Schlickmann, L Schlüter, B Schlüter, F Schmeisser, N Schmidt, T Schröder, F Schumacher, L Schwirn, S Sclafani, S Seckel, D Seen, L Seikh, M Seunarine, S Myhr, P Shah, R Shefali, S Shimizu, N Skrzypek, B Snihur, R Soedingrekso, J Søgaard, A Soldin, D Soldin, P Sommani, G Spannfellner, C Spiczak, G Spiering, C Stachurska, J Stamatikos, M Stanev, T Stezelberger, T Stürwald, T Stuttard, T Sullivan, G Taboada, I Ter-Antonyan, S Terliuk, A Thakuri, A Thiesmeyer, M Thompson, W Thwaites, J Tilav, S Tollefson, K Toscano, S Tosi, D Trettin, A Upadhyay, A Upshaw, K Vaidyanathan, A Valtonen-Mattila, N Valverde, J Vandenbroucke, J Van Eeden, T van Eijndhoven, N van Santen, J Vara, J Varsi, F Venugopal, M Vereecken, M Carrasco, S Verpoest, S Veske, D Vijai, A Villarreal, J Walck, C Wang, A Warrick, E Weaver, C Weigel, P Weindl, A Wen, A Wendt, C Werthebach, J Weyrauch, M Whitehorn, N Wiebusch, C Williams, D Witthaus, L Wolf, M Wrede, G Xu, X Yañez, J Yao, Y Yildizci, E Yoshida, S Young, R Yu, F Yu, S Yuan, T Zegarelli, A Zhang, S Zhang, Z Zhelnin, P Zilberman, P Physical Review D volume 112 issue 8 082004 (15 Oct 2025)
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.
Subscribe to