Past

In this talk, we discuss continuous in time dynamics for the problem of approaching the set of zeros of a single-valued monotone and continuous operator V . Such problems are motivated by minimax convexconcave and, in particular, by convex optimization problems with linear constraints. The central role is played by a second-order dynamical system that combines a vanishing damping term with the time derivative of V along the trajectory, which can be seen as an analogous of the Hessian-driven damping in case the operator is originating from a potential. We show that these methods exhibit fast convergence rates for kV (z(t))k as t ! +1, where z( ) denotes the generated trajectory, and for the restricted gap function, and that z( ) converges to a zero of the operator V . For the corresponding implicit and explicit discrete time models with Nesterov’s momentum, we prove that they share the asymptotic features of the continuous dynamics.

Extensions to variational inequalities and fixed-point problems are also addressed. The theoretical results are illustrated by numerical experiments on bilinear games and the training of generative adversarial networks.

What do fiber polymers and ice sheets have in common? They both flow with a directionally dependent - anisotropic - viscosity. This behaviour occurs in other geophysical flows, such as the Earth's mantle, where a material's microstructure affects its large-scale flow. In ice, the alignment of crystal orientations can cause the viscosity to vary by an order of magnitude, consequently having a strong impact on the flow of ice sheets and glaciers. However, the effect of anisotropy on large-scale flow is not well understood, due to a lack of understanding of a) the best physical approximations to model crystal orientations, and b) how crystal orientations affect rheology. In this work, we aim to address both these questions by linking rheology to crystal orientation predictions, and testing a range of models against observations from the Greenland ice sheet. The results show assuming all grains experience approximately the same stress provides realistic predictions, and we suggest a set of equations and parameters which can be used in large-scale models of ice sheets. 

I will present a recent work with G. Kocharyan, where we show the undecidability of the following two problems: given a finitely generated subgroup G of GL(n,Q), a) determine whether G has a non-identity element whose (i,j) entry is equal to zero, and b) determine whether the stabilizer of a given vector in G is non-trivial. Undecidability of problem b) answers a question of Dixon from 1985. The proofs reduce to the undecidability of the word problem for finitely presented groups.

I'll talk about the Morse local-to-global property and try to convince you that is a good property. There are three reasons. Firstly, it is satisfied by many examples of interest. Secondly, it allows to prove many theorems. Thirdly, it sits nicely in the larger program of classifying groups up to quasi-isometry and it has connections with open questions.

A $C^*$-diagonal is a certain commutative subalgebra of a $C^∗$ -algebra with a rich structure. Renault and Kumjian showed that finding a $C^*$ -diagonal of a $C^∗$-algebra is equivalent to realizing the $C^*$-algebra via a groupoid. This establishes a close connection between $C^∗$-diagonals and dynamics and allows one to relate the geometric properties of groupoids to the properties of $C^∗$ -diagonals. 

In this talk, I will explore the unique pure state extension property of an Abelian $C^*$-subalgebra of a 1-dim NCCW complex, the approximation of morphisms between two 1-dim NCCW complexes by $C^*$-diagonal preserving morphisms, and the existence of $C^*$-diagonal in inductive limits of certain 1-dim NCCW complexes.

Coboundary expansion is a notion introduced by Linial and Meshulam, and by Gromov that combines combinatorics topology and linear algebra. Kaufman and Lubotzky observed its relation to "Property testing", and in recent years it has found several applications in theoretical computer science, including for error correcting codes (both classical and quantum), for PCP agreement tests, and even for studying polarization in social networks.

In the talk I will introduce this notion and some of its applications. No prior knowledge is assumed, of course.

Oka theory is about the validity of the h-principle in complex analysis and geometry. In this expository lecture, I will trace its main developments, from the classical results of Kiyoshi Oka (1939) and Hans Grauert (1958), through the seminal work of Mikhail Gromov (1989), to the introduction of Oka manifolds (2009) and the present state of knowledge. The lecture does not assume any prior exposure to this theory.

We present a spectral method that converges exponentially for a variety of fractional integral equations on a closed interval. The method uses an orthogonal fractional polynomial basis that is obtained from an appropriate change of variable in classical Jacobi polynomials. For a problem arising from time-fractional heat and wave equations, we elaborate the complexities of three spectral methods, among which our method is the most performant due to its superior stability. We present algorithms for building the fractional integral operators, which are applied to the orthogonal fractional polynomial basis as matrices. 

I will talk about the behaviour of random maps on surfaces (for example, random triangulations) of given genus, when their size tends to infinity. Such questions can be asked from the viewpoint of the local behaviour (Benjamini-Schramm convergence) or global behaviour (diameter, Gromov Hausdorff convergence), and in both cases, much combinatorics is involved. I will survey the landmark results for the case of fixed genus, and state very recent results in which we manage to address the "high genus" regime, when the genus grows proportionally to the size – for this regime we establish isoperimetric inequalities and prove the long-suspected fact that the diameter is logarithmic with high probability.

Based on joint work with Thomas Budzinski and Baptiste Louf.

The scattering matrix in quantum mechanics must be unitary to ensure the conservation of the number of particles, hence their 
eigenvalues are unimodular.  In systems with fully developed Quantum Chaos  the statistics of those unimodular 
eigenvalues  is well described by  the Poisson kernel.
However, in real experiments  the associated scattering matrix is sub-unitary due to intrinsic losses,  and
 the moduli of S-matrix eigenvalues become non-trivial,  yet the corresponding theory is not well-developed in general.  
 I will present some results for the mean density of those moduli in the framework of random matrix models for the case of broken time-reversal invariance,
and discuss a way to get a generalization of the Poisson kernel to systems with uniform losses.

A graph $X$ is defined inductively to be $(a_0, . . . , a_{n−1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius 1 around $v$ is an $(a_1, . . . , a_{n−1})$-regular graph. A family $F$ of graphs is said to be an expander family if there is a uniform lower bound on the Cheeger constant of all the graphs in $F$. 

After briefly (re)introducing Coxeter groups and their geometries, we will describe how they can be used to construct very regular polytopes, which in turn can yield highly regular graphs. We will then use the super-approximation machinery, whenever the Coxeter group is hyperbolic, to obtain the expansion of these families of graphs. As a result, we obtain interesting infinite families of highly regular expander graphs, some of which are related to the exceptional groups. 

The talk is based on work joint with Conder, Lubotzky, and Schillewaert. 

The progress in our understanding of symmetries in QFT has led to the proposal that the complete information on a symmetry structure is encoded in a TQFT in one dimension higher, known as the Symmetry TFT. This picture is well understood for finite symmetries, and I will explain the extension to continuous symmetries in the first part of the talk, based on a paper with F. Benini. This extension requires studying new TQFTs with a non-compact spectrum of operators. Like for finite symmetries, these TQFTs capture anomalies and topological manipulations via their topological boundary conditions. The main new ingredient for continuous symmetries is dynamical gauging, which is described by maps between different TQFTs. I will use this to derive the Symmetry TFT for the non-invertible chiral symmetry of QED. Moreover, the various TQFTs related by dynamical gauging arise as different boundary conditions of a unique TQFT in two dimensions higher. In the second part of the talk, based on work in progress with F. Benini and G. Rizi, I will use these tools to derive some new connections between the Symmetry TFTs and the universal EFTs describing the spontaneous symmetry breaking of any (generalized) global symmetry.

In this talk, we study concentration properties for laws of non-linear Gaussian functionals on metric spaces. Our focus lies on measures with non-Gaussian tail behaviour which are beyond the reach of Talagrand’s classical Transportation-Cost Inequalities (TCIs). Motivated by solutions of Rough Differential Equations and relying on a suitable contraction principle, we prove generalised TCIs for functionals that arise in the theory of regularity structures and, in particular, in the cases of rough volatility and the two-dimensional Parabolic Anderson Model. Our work also extends existing results on TCIs for diffusions driven by Gaussian processes.

We study fully discrete approximation of the 2D Euler equations for ideal homogeneous fluids. We focus on spectral methods and  discuss rates of convergence of velocity and vorticity under different assumptions on the smoothness of the data.

Modular curves are moduli spaces of elliptic curves equipped with certain level structures. This talk will be concerned with how the attendant theory has been used to answer questions about the modularity of elliptic curves over $\mathbb{Q}$ and over quadratic fields. In particular, we will outline two instances of the modularity switching technique over totally real fields: the 3-5 trick of Wiles and the 3-7 trick of Freitas, Le Hung and Siksek. The recent work of Caraiani and Newton over imaginary quadratic fields naturally leads one to consider the descent theory of 'twisted' modular curves, and this will be the focus of the final part of the talk.

The objects of arithmetic geometry are not manifolds. Some concepts from differential geometry admit analogues in arithmetic, but they are not straightforward. Nevertheless, there is a growing sense that the right way to understand certain Langlands phenomena is to study quantum field theories on these objects. What hope is there of making this thought precise? I will propose the beginnings of a mathematical framework via a general theory of factorization algebras. A new feature is a subtle piece of additional structure on our objects – what I call an _isolability structure_ – that is ordinarily left implicit.

This talk, based on joint work with Alexander Zlokapa, concerns Bayesian inference with neural networks. 

I will begin by presenting a result giving exact non-asymptotic formulas for Bayesian posteriors in deep linear networks. A key takeaway is the appearance of a novel scaling parameter, given by # data * depth / width, which controls the effective depth of the posterior in the limit of large model and dataset size. 

Additionally, I will explain some quite recent results on the role of this effective depth parameter in Bayesian inference with deep non-linear neural networks that have shaped activations.

Speaker: Mattia Magnabosco (Newton Fellow, Maths)
Title: Synthetic Ricci curvature bounds in sub-Riemannian manifolds
Abstract: In Riemannian manifolds, a uniform bound on the Ricci curvature tensor allows to control the volume growth along the geodesic flow. Building upon this observation, Lott, Sturm and Villani introduced a synthetic notion of curvature-dimension bounds in the non-smooth setting of metric measure spaces. This condition, called CD(K,N), is formulated in terms of the optimal transport interpolation of measures and consists in a convexity property of the Rényi entropy functionals along Wasserstein geodesics. The CD(K,N) condition represents a lower Ricci curvature bound by K and an upper bound on the dimension by N, and it is coherent with the smooth setting, as in a Riemannian manifold it is equivalent to a lower bound on the Ricci curvature tensor. However, the same relation between curvature and CD(K,N) condition does not hold for sub-Riemannian (and sub-Finsler) manifolds. 

Speaker: Rebecca Lewis (Florence Nightingale Bicentenary Fellow, Stats)
Title: High-dimensional statistics
Abstract: Due to the increasing ease with which we collect and store information, modern data sets have grown in size. Whilst these datasets have the potential to yield new insights in a variety of areas, extracting useful information from them can be difficult. In this talk, we will discuss these challenges.

Periodic point clouds naturally arise when modelling large homogenous structures like crystals. They are naturally attributed with a map to a d-dimensional torus given by the quotient of translational symmetries, however there are many surprisingly subtle problems one encounters when studying their (persistent) homology. It turns out that bisheaves are a useful tool to study periodic data sets, as they unify several different approaches to study such spaces. The theory of bisheaves and persistent local systems was recently introduced by MacPherson and Patel as a method to study data with an attributed map to a manifold through the fibres of this map. The theory allows one to study the data locally, while also naturally being able to appeal to local systems of (co)sheaves to study the global behaviour of this data. It is particularly useful, as it permits a persistence theory which generalises the notion of persistent homology. In this talk I will present recent work on the theory and implementation of bisheaves and local systems to study 1-periodic simplicial complexes. Finally, I will outline current work on generalising this theory to study more general periodic systems for d-periodic simplicial complexes for d>1. 

Associated to a complex admissible representation of a p-adic group is an invariant known is the "canonical dimension". It is closely related to the more well-studied invariant called the "wavefront set". The advantage of the canonical dimension over the wavefront set is that it allows for a completely different approach in computing it compared to the known computational methods for the wavefront set. In this talk we illustrate this point by finding a lower bound for the canonical dimension of any depth-zero supercuspidal representation, which depends only on the group and so is independent of the representation itself. To compute this lower bound, we consider the geometry of the associated Bruhat-Tits building.

(Joint work with S. Montenegro)

The striking resemblance between the behaviour of pseudo-algebraically closed, pseudo real closed and pseudo p-adically fields has lead to numerous attempts at describing their properties in a unified manner. In this talk I will present another of these attempts: the class of pseudo-T-closed fields, where T is an enriched theory of fields. These fields verify a « local-global » principle with respect to models of T for the existence of points on varieties. Although it very much resembles previous such attempts, our approach is more model theoretic in flavour, both in its presentation and in the results we aim for.

The first result I would like to present is an approximation result, generalising a result of Kollar on PAC fields, respectively Johnson on henselian fields. This result can be rephrased as the fact that existential closeness in certain topological enrichments come for free from existential closeness as a field. The second result is a (model theoretic) classification result for bounded pseudo-T-closed fields, in the guise of the computation of their burden. One of the striking consequence of these two results is that a bounded perfect PAC field with n independent valuations has burden n and, in particular, is NTP2.

The talk is based on joint work with Lasse Grimmelt. We prove a theorem that allows one to count solutions to determinant equations twisted by a periodic weight with high uniformity in the modulus. It is obtained by using spectral methods of $\operatorname{SL}_2(\mathbb{R})$ automorphic forms to study Poincaré series over congruence subgroups while keeping track of interactions between multiple orbits. This approach offers increased flexibility over the widely used sums of Kloosterman sums techniques. We give applications to correlations of the divisor function twisted by periodic functions and the fourth moment of Dirichlet $L$-functions on the critical line.

We show the super-hedging duality for multi-action options which generalise American options to a larger space of actions (possibly uncountable) than {stop, continue}. We put ourselves in the framework of Bouchard & Nutz model relying on analytic measurable selection theorem. Finally we consider information delay on the action component of the product space. Information delay is expressed as a possibility to look into the future in the dual formulation. This is a joint work with Ivan Guo, Shidan Liu and Zhou Zhou.

Artificial Intelligence (AI) will strongly determine our future prosperity and well-being. Due to its generic nature, AI will have an impact on all sciences and business sectors, our private lives and society as a whole. AI is pre-eminently a multidisciplinary technology that connects scientists from a wide variety of research areas, from behavioural science and ethics to mathematics and computer science.

Without downplaying the importance of that variety, it is apparent that mathematics can and should play an active role. All the more so as, alongside the successes of AI, also critical voices are increasingly heard. As Robert Dijkgraaf (former director of the Princeton Institute of Advanced Studies) observed in May 2019: ”Artificial intelligence is in its adolescent phase, characterised by trial and error, self-aggrandisement, credulity and lack of systematic understanding.” Mathematics can contribute to the much-needed systematic understanding of AI, for example, greatly improving reliability and robustness of AI algorithms, understanding the operation and sensitivity of networks, reducing the need for abundant data sets, or incorporating physical properties into neural networks needed for super-fast and accurate simulations in the context of digital twinning.

Mathematicians absolutely recognize the potential of artificial intelligence, machine learning and (deep) neural networks for future developments in science, technology and industry. At the same time, a sound mathematical treatment is essential for all aspects of artificial intelligence, including imaging, speech recognition, analysis of texts or autonomous driving, implying it is essential to involve mathematicians in all these areas. In this presentation, we highlight the role of mathematics as a key enabling technology within the emerging field of scientific machine learning. Or, as I always say: ”Real intelligence is needed to make artificial intelligence work.”

Minimal surfaces, which are critical points of the area functional, have long been a source of fruitful problems in geometry. In this talk, I will introduce a new approach, primarily coming from a recent paper of M. Struwe, to constructing free boundary minimal discs using a gradient flow of a suitable energy functional. I will discuss the uniqueness of solutions to the gradient flow, including recent work on the uniqueness of weak solutions, and also what is known about the qualitative behaviour of the flow, especially regarding the interpretation of singularities which arise. Time permitting, I will also mention ongoing joint work with M. Rupflin and M. Struwe on extending this theory to general surfaces with boundary.

Traditionally, stochastic processes are modelled one of two ways: a continuum Fokker-Planck approach, where a PDE is solved to determine the time evolution of the probability density, or a Langevin approach, where the SDE describing the system is sampled, and multiple simulations are used to collect statistics. There is also a third way: the functional or path integral. Originally developed by Wiener in the 1920s to model Brownian motion, path integrals were famously applied to quantum mechanics by Feynman in the 1950s. However, they also have much to offer classical stochastic processes (and statistical physics).  

In this talk I will introduce the formalism at a physicist’s level of rigour, and focus on determining the dominant contribution to the path integral when the noise is weak. There exists a remarkable correspondence between the most-probable stochastic paths and Hamiltonian dynamics in an effective potential [1,2,3]. I will then discuss some applications, including reaction pathways conditioned on finite time [2]. We demonstrate that the most probable pathway at a finite time may be very different from the usual minimum energy path used to calculate the average reaction rate. If time permits, I will also discuss the extremely nonlinear crystal dislocation response to applied stress [4].  

[1] Ge, Hao, and Hong Qian. Int. J. Mod. Phys. B 26.24 1230012 (2012)     

[2] Fitzgerald, Steve, et al. J. Chem. Phys. 158.12 (2023).

[3] Honour, Tom and Fitzgerald, Steve. in press J. Phys. A (2024)

[4] Fitzgerald, Steve. Sci. Rep. 6 (1) 39708 (2016)

Motivated by work of Hrushovski on pseudofinite fields with an additive character we investigate the theory ACFA+ which is the model companion of the theory of difference fields with an additive character on the fixed field. Building on results by Hrushovski we can recover it as the characteristic 0-asymptotic theory of the algebraic closure of finite fields with the Frobenius-automorphism and the standard character on the fixed field. We characterise 3-amalgamation in ACFA+. As cosequences we obtain that ACFA+ is a simple theory, an explicit description of the connected component of the Kim-Pillay group and (weak) elimination of imaginaries. If time permits we present some results on higher amalgamation.

RFRS groups were introduced by Ian Agol in connection with virtual fibering of 3-manifolds. Notably, the class of RFRS groups contains all compact special groups, which are groups with particularly nice cocompact actions on cube complexes. In this talk, I will give an introduction to ℓ²-Betti numbers from an algebraic perspective and discuss what group theoretic properties we can conclude from the (non)vanishing of the ℓ²-Betti numbers of a RFRS group.

One possible version of the Kirchberg—Phillips theorem states that simple, separable, nuclear, purely infinite C*-algebras are classified by KK-theory. In order to generalize this result to non-simple C*-algebras, Kirchberg first restricted his attention to those that absorb the Cuntz algebra O2 tensorially. C*-algebras in this class carry no KK-theoretical information in a strong sense, and they are classified by their ideal structure alone. It should be mentioned that, although this result is in Kirchberg’s work, its full proof was first published by Gabe. In joint work with Gábor Szabó, we showed a generalization of Kirchberg's O2-stable theorem that classifies G-C*-algebras up to cocycle conjugacy, where G is any second-countable, locally compact group. In our main result, we assume that actions are amenable, sufficiently outer, and absorb the trivial action on O2 up to cocycle conjugacy. In very recent work, I moreover show that the range of the classification invariant, consisting of a topological dynamical system over primitive ideals, is exhausted for any second-countable, locally compact group.

In this talk, I will recall the classification of O2-stable C*-algebras, and describe their classification invariant. Subsequently, I will give a short introduction to the C*-dynamical working framework and present the classification result for equivariant O2-stable actions. Time permitting, I will give an idea of how one can build a C*-dynamical system in the scope of our classification with a prescribed invariant. 

Let X and H be large, and consider n ranging from 1 to X. For an arithmetic function f(n), what is the best mean square approximation of f(n) by a restricted divisor sum (a function of the sort sum_{d|n, d < H} a_d)? I hope to explain how for a wide variety of arithmetic functions, when X grows and H grows like a power of X, a solution of this problem is connected to the evaluation of random matrix integrals. The problem is connected to some combinatorial formula for computing high moments of traces of random unitary matrices and I hope to discuss this also.

Measure equivalence was introduced by Gromov as a measure-theoretic analogue to quasi-isometry between finitely generated groups. In this talk I will present measure equivalence classification results for right-angled Artin groups, and more generally graph products. This is based on joint works with Jingyin Huang and with Amandine Escalier. 

The saturation number of a graph is a famous and well-studied counterpoint to the Turán number, and the rainbow saturation number is a generalisation of the saturation number to the setting of coloured graphs. Specifically, for a given graph $F$, an edge-coloured graph is $F$-rainbow saturated if it does not contain a rainbow copy of $F$, but the addition of any non-edge in any colour creates a rainbow copy of $F$. The rainbow saturation number of $F$ is the minimum number of edges in an $F$-rainbow saturated graph on $n$ vertices. Girão, Lewis, and Popielarz conjectured that, like the saturation number, for all $F$ the rainbow saturation number is linear in $n$. I will present our attractive and elementary proof of this conjecture, and finish with a discussion of related results and open questions.

One of the oldest open problems in representation theory is to classify the irreducible unitary representations of a semisimple Lie group G_R. Such representations play a fundamental role in harmonic analysis and the Langlands program and arise in physics as the state space of quantum mechanical systems in the presence of G_R-symmetry. Most unitary representations of G_R are realized, via some kind of induction, from unitary representations of proper Levi subgroups. Thus, the major obstacle to understanding the unitary dual of G_R is identifying the "non-induced" unitary representations of G_R. In previous joint work with Losev and Matvieievskyi, we have proposed a general construction of these non-induced representations, which we call "unipotent" representations of G_R. Unfortunately, the methods we employ do not provide a proof that these representations are unitary. In this talk, I will explain how one can apply Saito's theory of mixed Hodge modules to overcome this difficulty, giving a uniform proof of the unitarity of all unipotent representations. This is joint work in progress with Dougal Davis

We study the stochastic quantisation for the fractional $\varphi^4$ theory. The model has been studied by Brydges, Mitter and Scopola in 2003 as a natural extension of $\phi^4$ theories to fractional sub-critical dimensions. The stochastic quantisation equation is given by the (formal) SPDE 

\[

(\partial_t + (-\Delta)^{s}) \varphi = - \lambda \varphi^3 + \xi\]

where $\xi$ is a space-time white noise over the three dimensional torus. The equation is sub-critical for $s > \frac{3}{4}$.

We derive a priori estimates in the full sub-critical regime $s>\frac{3}{4}$. These estimates rule out explosion in finite time and they imply the existence of an invariant measure with a standard Krylov-Bogoliubov argument. 

Our proof is based on the strategy developed for the parabolic case $s=1$ in [Chandra, Moinat, Weber, ARMA 2023]. In order to implement this strategy here, a new Schauder estimate for the fractional heat operator is developed. Additionally, several algebraic arguments from [Chandra, Moinat, Weber, ARMA 2023] are streamlined significantly. 

This is joint work with Hendrik Weber (Münster). 

It is a classical fact of rational homotopy theory that the $E_\infty$-algebra of rational cochains on a sphere is formal, i.e., quasi-isomorphic to the cohomology of the sphere. In other words, this algebra is square-zero. This statement fails with integer or mod p coefficients. We show, however, that the cochains of the n-sphere are still $E_n$-trivial with coefficients in arbitrary cohomology theories. This is a consequence of a more general statement on (iterated) loops and suspensions of $E_n$-algebras, closely related to Koszul duality for the $E_n$-operads. We will also see that these results are essentially sharp: if the R-valued cochains of $S^n$ have square-zero $E_{n+1}$-structure (for some rather general ring spectrum R), then R must be rational. This is joint work with Markus Land.

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x + y + z = 0$ other than when $x = y = z$, or equivalently no non-trivial $3$-term arithmetic progressions. The cap set problem asks how large a cap set can be, and is an important problem in additive combinatorics and combinatorial number theory. In this talk, I will introduce the problem, give some background and motivation, and describe how I was able to provide the first progress in 20 years on the lower bound for the size of a maximal cap set. Building on a construction of Edel, we use improved computational methods and new theoretical ideas to show that, for large enough $n$, there is always a cap set in $\mathbb{F}_3^n$ of size at least $2.218^n$. I will then also discuss recent developments, including an extension of this result by Google DeepMind.

We consider the sharp interface limit problem for 1D stochastic Allen-Cahn equation, and extend a classic result by Funaki to the full small noise regime. One interesting point is that the notion of "small noise" turns out to depend on the topology one uses. The main new idea in the proof is the construction of a series of functional correctors, which are designed to recursively cancel out potential divergences. At a technical level, in order to show these correctors are well behaved, we also develop a systematic decomposition of functional derivatives of the deterministic Allen-Cahn flow of all orders, which might have its own interest.
Based on a joint work with Wenhao Zhao (EPFL) and Shuhan Zhou (PKU).

Deep Gaussian processes have proved remarkably successful as a tool for various statistical inference tasks. This success relates in part to the flexibility of these processes and their ability to capture complex, non-stationary behaviours. 

In this talk, we will introduce the general framework of deep Gaussian processes, in which many examples can be constructed, and demonstrate their superiority in inverse problems including computational imaging and regression.

 We will discuss recent algorithmic developments for efficient sampling, as well as recent theoretical results which give crucial insight into the behaviour of the methodology.

 

From genetic studies and astrophysics simulations to statistical modelling and AI, scientific computing has enabled amazing discoveries and there is no doubt it will continue to do so. However, the corresponding environmental impact is a growing concern in light of the urgency of the climate crisis, so what can we all do about it? Tackling this issue and making it easier for scientists to engage with sustainable computing is what motivated the Green Algorithms project. Through the prism of the GREENER principles for environmentally sustainable science, we will discuss what we learned along the way, how to estimate the impact of our work and what levers scientists and institutions have to make their research more sustainable. We will also debate what hurdles exist and what is still needed moving forward.

The Junior Algebra and Representation Theory Seminar will kick-off the start of Trinity term with a social event in the common room. Come to catch up with your fellow students and maybe play a board game or two. Afterwards we'll have lunch together.