We present a homotopy-theoretic method for calculating Ext groups between polynomial functors from the category of (finitely generated, free) groups to abelian groups. It enables us to substantially extend the range of what can be calculated. In particular, we can calculate torsion in the Ext groups, about which very little has been known. We will discuss some applications to the stable cohomology of Aut(F_n), based on a theorem of Djament.   

Deep convolutional neural networks such as GoogLeNet and ResNet have become ubiquitous in image classification tasks, whereas
transformer-based language models such as BERT and its variants have found widespread use in natural language processing. In this talk, I
will discuss recent efforts in exploring the topology of artificial neuron activations in deep learning, from images to word embeddings.
First, I will discuss the topology of convolutional neural network activations, which provides semantic insight into how these models
organize hierarchical class knowledge at each layer. Second, I will discuss the topology of word embeddings from transformer-based models.
I will explore the topological changes of word embeddings during the fine-tuning process of various models and discover model confusions in
the embedding spaces. If time permits, I will discuss on-going work in studying the topology of neural activations under adversarial attacks.
 

In this talk, I will present the notion of projected barcodes and projected distances for multi-parameter persistence modules. Projected barcodes are defined as derived pushforward of persistence modules onto R. Projected distances come in two flavors: the integral sheaf metrics (ISM) and the sliced convolution distances (SCD). I will explain how the fibered barcode is a particular instance of projected barcodes and how the ISM and the SCD provide lower bounds for the convolution distance. 

Furthermore, in the case where the persistence module considered is the sublevel-sets persistence modules of a function f : X -> R^n, we will explain how, under mild conditions, the projected barcode of this module by a linear map u : R^n \to R is the collection of sublevel-sets barcodes of the composition uf . In particular, it can be computed using software dedicated to one-parameter persistence modules. This is joint work with Nicolas Berkouk.

Dimensionality reduction is the machine learning problem of taking a data set whose elements are described with potentially many features (e.g., the pixels in an image), and computing representations which are as economical as possible (i.e., with few coordinates). In this talk, I will present a framework to leverage the topological structure of data (measured via persistent cohomology) and construct low dimensional coordinates in classifying spaces consistent with the underlying data topology.

I will survey on the cluster structure of random geometric graphs in a regime that is less discussed in the literature. The statistics of interest include the number of k-components, the number of components, the number of vertices in the giant component, and the connectivity threshold. We show LLN and normal/Poisson approximation by Stein's method. Based on recent joint works with Mathew Penrose (Bath).

TBC

Multi-parameter persistence is a main research topic in topological data analysis. Major questions involve the computation and the structural properties
of persistence modules. In this context, I will sketch two very recent results:

(1) We define a natural bifiltration called the localized union-of-balls bifiltration that contains filtrations studied in the context of local persistent homology as slices. This bifiltration is not k-critical for any finite k. Still, we show that a representation of it (involving algebraic curves of low degree) can be computed exactly and efficiently. This is joint work with Matthias Soels (TU Graz).

(2) Every persistence modules permits a unique decomposition into indecomposable summands. Intervals are the simplest type of summands, but more complicated indecomposables can appear, and usually do appear in examples. We prove that for homology-dimension 0 and density-Rips bifiltration, at least a quarter of the indecomposables are intervals in expectation for a rather general class of point samples. Moreover, these intervals can be ``peeled off'' the module efficiently. This is joint work with Angel Alonso (TU Graz).

A central topic of study in analytic number theory is the behaviour of the Riemann zeta function. Many theorems and conjectures in this area are closely connected to concepts from probability theory. In this talk, we will discuss several results on the typical size of the zeta function on the critical line, over different scales. Along the way, we will see the role that is played by some probabilistic phenomena, such as the central limit theorem and multiplicative chaos.