The boundedness of Fourier multipliers on non-commutative $L_p$-spaces ($1 < p < \infty$) is a fundamental problem in non-commutative analysis. Building on the non-commutative Cotlar identity introduced by Mei and Ricard (2017), which yields $L_p$-boundedness ($1 < p < \infty$) of Hilbert transforms on amalgamated free products of finite von Neumann algebras, their approach relies heavily on freeness in the underlying free product structure.

In this talk, Xiaoqi Lu introduces a new strategy that overcomes this limitation. Our approach combines a generalized Cotlar identity, which holds on suitable subspaces and captures non-freeness information, with an additional condition related to the property of Rapid Decay to control the remaining components. From this framework, we establish the $L_p$-boundedness ($1 < p < \infty$) of Rademacher-type Hilbert transforms on graph products of finite von Neumann algebras. This unified framework extends earlier results for free products of finite von Neumann algebras and for graph products of groups acting on right-angled buildings. This is a joint work with Runlian Xia.

Dr Lindon Roberts will talk about: 'Optimization Algorithms for Bilevel Learning with Applications to Imaging'

Many imaging problems, such as denoising or inpainting, can be expressed as variational regularization problems. These are optimization problems for which many suitable algorithms exist. We consider the problem of learning suitable regularizers for imaging problems from example (training) data, which can be formulated as a large-scale bilevel optimization problem. 

In this talk, I will introduce new deterministic and stochastic algorithms for bilevel optimization, which require no or minimal hyperparameter tuning while retaining convergence guarantees. 

This is joint work with Mohammad Sadegh Salehi and Matthias Ehrhardt (University of Bath), and Subhadip Mukherjee (IIT Kharagpur).

TBA

TBA

TBA

TBA 

TBA

TBA

This is a joint OxPDE and Numerical Analysis seminar. 

to follow

TBA

Stochastic search is ubiquitous in biology and ecology, from synaptic transmission and intracellular signaling to predators seeking prey and the spread of disease. In dynamic systems like these, the number of 'searchers' is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these dynamics, their combined influence on search times remains largely unexplored. In this talk we will introduce a general framework for stochastic search in which agents progressively join and leave the process, a mechanism we term 'dynamic redundancy and mortality'. Under minimal assumptions on the underlying search dynamics, our framework yields the exact distribution of the first-passage time to a target region and further reveals surprising connections to stochastic search with stochastic resetting, wherein a single searcher is randomly 'reset' to its initial state. We will then treat the target region as a queue, which we show has interarrival times governed by a thinned nonhomogeneous Poisson process. Altogether this work provides a rigorous foundation for studying stochastic search processes with a fluctuating number of searchers. This work is in collaboration with Dr. Aanjaneya Kumar (Santa Fe Institute) and José Giral-Barajas (Imperial College London).

TBA

TBA

TBA

Professor Pereyra will talk about; 'Physics-informed deep generative models: Applications to computational sensing'

This talk introduces a novel mathematical and computational framework for constructing high-dimensional Bayesian inversion methods that leverage state-of-the-art generative denoising diffusion models as highly informative priors. A central innovation is the construction of physics-informed generative models using Langevin diffusion processes and Markov chain Monte Carlo (MCMC) sampling techniques to develop stochastic neural network architectures capable of near-exact sampling. The obtained networks are modular and composed of interpretable layers that are directly related to statistical image priors and data likelihoods derived from forward observation models. The layers encoding the data likelihood function are designed for flexibility, enabling scene and instrument model parameters to be specified at inference time and seamlessly integrated with pre-trained foundational generative priors. To achieve high computational efficiency, we employ adversarial model distillation, which yields excellent sampling performance with as few as four Markov chain Monte Carlo steps, even in problems exceeding one million dimensions. Our approach is validated through non-asymptotic convergence analysis and extensive numerical experiments in computational image and video restoration. We conclude by discussing unsupervised training strategies that allow the models to be fine-tuned directly from measurement data, thereby bypassing the need for clean reference data.

The talk is based on recent work in physics-informed generative AI for Bayesian imaging: https://arxiv.org/abs/2503.12615 (ICCV 2025), which uses a distilled latent Stable Diffusion XL model trained on five billion clean images as a zero-shot prior, and  https://arxiv.org/pdf/2507.02686, which integrates pixel-based diffusion models with deep unfolding and diffusion distillation (TMLR 2025). The extension to video restoration is presented in https://arxiv.org/abs/2510.01339 (ICLR 2025). Our approach to unsupervised training of diffusion models is introduced in https://arxiv.org/abs/2510.11964.