We consider the reinforcement learning problem of controlling an unknown dynamical system to maximise the long-term average reward along a single trajectory. Most of the literature considers system interactions that occur in discrete time and discrete state-action spaces. Although this standpoint is suitable for games, it is often inadequate for systems in which interactions occur at a high frequency, if not in continuous time, or those whose state spaces are large if not inherently continuous. Perhaps the only exception is the linear quadratic framework for which results exist both in discrete and continuous time. However, its ability to handle continuous states comes with the drawback of a rigid dynamic and reward structure.

        This work aims to overcome these shortcomings by modelling interaction times with a Poisson clock of frequency $\varepsilon^{-1}$ which captures arbitrary time scales from discrete ($\varepsilon=1$) to continuous time ($\varepsilon\downarrow0$). In addition, we consider a generic reward function and model the state dynamics according to a jump process with an arbitrary transition kernel on $\mathbb{R}^d$. We show that the celebrated optimism protocol applies when the sub-tasks (learning and planning) can be performed effectively. We tackle learning by extending the eluder dimension framework and propose an approximate planning method based on a diffusive limit ($\varepsilon\downarrow0$) approximation of the jump process.

        Overall, our algorithm enjoys a regret of order $\tilde{\mathcal{O}}(\sqrt{T})$ or $\tilde{\mathcal{O}}(\varepsilon^{1/2} T+\sqrt{T})$ with the approximate planning. As the frequency of interactions blows up, the approximation error $\varepsilon^{1/2} T$ vanishes, showing that $\tilde{\mathcal{O}}(\sqrt{T})$ is attainable in near-continuous time.

In this presentation, we will review how the field of Mechanics of Materials is generally framed and see how it can benefit from and be of benefit to the current progress in AI. We will approach this problematic in the particular context of Brain mechanics with an application to traumatic brain injury in police investigations. Finally we will briefly show how our group is currently applying the same methodology to a range of engineering challenges.

In this short course, we survey the celebrated weak and strong compactness theorems proved by Karen Uhlenbeck in 1982. These results are fundamental to the gauge theory and have found numerous applications to geometry, topology, and theoretical physics. The proof is based on the ingenious idea of putting connections into ``Uhlenbeck--Coulomb gauge'', which enables the use of standard elliptic and/or nonlinear PDE techniques, as well as involved local-to-global patching arguments. We aim at giving detailed explanation of the proof, and we shall also discuss the relation between Uhlenbeck's compactness and the classical geometric problem of isometric immersions of submanifolds into Euclidean spaces.

Morphogen protein gradients play an essential role in the spatial regulation of patterning during embryonic development.  The most commonly accepted mechanism of protein gradient formation involves the diffusion and degradation of morphogens from a localized source. Recently, an alternative mechanism has been proposed, which is based on cell-to-cell transport via thin, actin-rich cellular extensions known as cytonemes. It has been hypothesized that cytonemes find their targets via a random search process based on alternating periods of retraction and growth, perhaps mediated by some chemoattractant. This is an actin-based analog of the search-and-capture model of microtubules of the mitotic spindle searching for cytochrome binding sites (kinetochores) prior to separation of cytochrome pairs. In this talk, we introduce a search-and-capture model of cytoneme-based morphogenesis, in which nucleating cytonemes from a source cell dynamically grow and shrink until making contact with a target cell and delivering a burst of morphogen. We model the latter as a one-dimensional search process with stochastic resetting, finite returns times and refractory periods. We use a renewal method to calculate the splitting probabilities and conditional mean first passage times (MFPTs) for the cytoneme to be captured by a given target cell. We show how multiple rounds of search-and-capture, morphogen delivery, cytoneme retraction and nucleation events lead to the formation of a morphogen gradient. We proceed by formulating the morphogen bursting model as a queuing process, analogous to the study of translational bursting in gene networks. We end by briefly discussing current work on a model of cytoneme-mediated within-host viral spread.