Please note that the list below only shows forthcoming events, which may not include regular events that have not yet been entered for the forthcoming term. Please see the past events page for a list of all seminar series that the department has on offer.

 

Past events in this series


Thu, 23 Oct 2025

13:00 - 14:00
Lecture Room 5

Markov α-potential games

Xinyu Li
(Mathematical Institute (University of Oxford))
Abstract

We propose a new framework of Markov α-potential games to study Markov games. 

We show that any Markov game with finite-state and finite-action is a Markov α-potential game, and establish the existence of an associated α-potential function. Any optimizer of an α-potential function is shown to be an α-stationary Nash equilibrium. We study two important classes of practically significant Markov games, Markov congestion games and the perturbed Markov team games, via the framework of Markov α-potential games, with explicit characterization of an upper bound for αand its relation to game parameters. 

Additionally, we provide a semi-infinite linear programming based formulation to obtain an upper bound for α for any Markov game. 

Furthermore, we study two equilibrium approximation algorithms, namely the projected gradient- ascent algorithm and the sequential maximum improvement algorithm, along with their Nash regret analysis.

 

This talk is part of the Erlangen AI Hub.

 

 

 

Mon, 03 Nov 2025

14:00 - 15:00
Lecture Room 3

A Langevin sampler for quantum tomography

Dr Estelle Massart
(Université catholique de Louvain (Belgium))
Abstract

Quantum tomography involves obtaining a full classical description of a prepared quantum state from experimental results. We propose a Langevin sampler for quantum tomography, that relies on a new formulation of Bayesian quantum tomography exploiting the Burer-Monteiro factorization of Hermitian positive-semidefinite matrices. If the rank of the target density matrix is known, this formulation allows us to define a posterior distribution that is only supported on matrices whose rank is upper-bounded by the rank of the target density matrix. Conversely, if the target rank is unknown, any upper bound on the rank can be used by our algorithm, and the rank of the resulting posterior mean estimator is further reduced by the use of a low-rank promoting prior density. This prior density is a complex extension of the one proposed in [Annales de l’Institut Henri Poincaré Probability and Statistics, 56(2):1465–1483, 2020]. We derive a PAC-Bayesian bound on our proposed estimator that matches the best bounds available in the literature, and we show numerically that it leads to strong scalability improvements compared to existing techniques when the rank of the density matrix is known to be small.

 

Mon, 17 Nov 2025

14:00 - 15:00
Lecture Room 3

Self-Supervised Machine Imaging

Prof Mike Davies
(University of Edinburgh)
Abstract

Modern deep learning methods provide the state-of-the-art in image reconstruction in most areas of computational imaging. However, such techniques are very data hungry and in a number of key imaging problems access to ground truth data is challenging if not impossible. This has led to the emergence of a range of self-supervised learning algorithms for imaging that attempt to learn to image without ground truth data. 

In this talk I will review some of the existing techniques and look at what is and might be possible in self-supervised imaging.