Perverse sheaves are an indispensable tool in representation theory. Their stalks often encode important representation theoretic information such as composition multiplicities or canonical bases. For the nilpotent cone, there is an algorithm that computes these stalks, known as the Lusztig-Shoji algorithm. In this talk, we discuss how this algorithm can be modified to compute stalks of perverse sheaves on more general varieties. As an application, we obtain a new algorithm for computing canonical bases in certain quantum groups as well as composition multiplicities for standard modules of the affine Hecke algebra of $\mathrm{GL}_n$.

This course will serve as an introduction to the theory of gradient flows with an emphasis on the recent advances in metric spaces. More precisely, we will start with an overview of gradient flows from the Euclidean theory to its generalisation to metric spaces, in particular Wasserstein spaces. This also includes a short introduction to the Optimal Transport theory, with a focus on specific concepts and tools useful subsequently. We will then analyse the time-discretisation scheme à la Jordan--Kinderlehrer-Otto (JKO), also known as minimising movement, and discuss the role of convexity in proving stability, uniqueness, and long-time behaviour for the PDE under study. Finally, we will comment on recent advances, e.g., in the study of PDEs on graphs and/or particle approximation of diffusion equations.

PhD_course_Esposito_1.pdf

This course will serve as an introduction to the theory of gradient flows with an emphasis on the recent advances in metric spaces. More precisely, we will start with an overview of gradient flows from the Euclidean theory to its generalisation to metric spaces, in particular Wasserstein spaces. This also includes a short introduction to the Optimal Transport theory, with a focus on specific concepts and tools useful subsequently. We will then analyse the time-discretisation scheme à la Jordan--Kinderlehrer-Otto (JKO), also known as minimising movement, and discuss the role of convexity in proving stability, uniqueness, and long-time behaviour for the PDE under study. Finally, we will comment on recent advances, e.g., in the study of PDEs on graphs and/or particle approximation of diffusion equations.

PhD_course_Esposito_0.pdf

PhD_course_Esposito.pdfThis course will serve as an introduction to the theory of gradient flows with an emphasis on the recent advances in metric spaces. More precisely, we will start with an overview of gradient flows from the Euclidean theory to its generalisation to metric spaces, in particular Wasserstein spaces. This also includes a short introduction to the Optimal Transport theory, with a focus on specific concepts and tools useful subsequently. We will then analyse the time-discretisation scheme à la Jordan--Kinderlehrer-Otto (JKO), also known as minimising movement, and discuss the role of convexity in proving stability, uniqueness, and long-time behaviour for the PDE under study. Finally, we will comment on recent advances, e.g., in the study of PDEs on graphs and/or particle approximation of diffusion equations.

This DPhil short course will serve as an introduction to the theory of gradient flows with an emphasis on the recent advances in metric spaces. More precisely, we will start with an overview of gradient flows from the Euclidean theory to its generalisation to metric spaces, in particular Wasserstein spaces. This also includes a short introduction to the Optimal Transport theory, with a focus on specific concepts and tools useful subsequently. We will then analyse the time-discretisation scheme à la Jordan--Kinderlehrer-Otto (JKO), also known as minimising movement, and discuss the role of convexity in proving stability, uniqueness, and long-time behaviour for the PDE under study. Finally, we will comment on recent advances, e.g., in the study of PDEs on graphs and/or particle approximation of diffusion equations.

Sparse inversion and classification problems are ubiquitous in modern data science and imaging. They are often formulated as non-smooth minimisation problems. In sparse inversion, we minimise, e.g., the sum of a data fidelity term and an L1/LASSO regulariser. In classification, we consider, e.g., the sum of a data fidelity term and a non-smooth Ginzburg--Landau energy. Standard (sub)gradient descent methods have shown to be inefficient when approaching such problems. Splitting techniques are much more useful: here, the target function is partitioned into a sum of two subtarget functions -- each of which can be efficiently optimised. Splitting proceeds by performing optimisation steps alternately with respect to each of the two subtarget functions.

In this work, we study splitting from a stochastic continuous-time perspective. Indeed, we define a differential inclusion that follows one of the two subtarget function's negative subdifferential at each point in time. The choice of the subtarget function is controlled by a binary continuous-time Markov process. The resulting dynamical system is a stochastic approximation of the underlying subgradient flow. We investigate this stochastic approximation for an L1-regularised sparse inversion flow and for a discrete Allen-Cahn equation minimising a Ginzburg--Landau energy. In both cases, we study the longtime behaviour of the stochastic dynamical system and its ability to approximate the underlying subgradient flow at any accuracy. We illustrate our theoretical findings in a simple sparse estimation problem and also in low- and high-dimensional classification problems.