L6

This presentation introduces a rigorous framework for the study of commonly used machine learning techniques (kernel methods, random feature maps, etc.) in the regime of large dimensional and numerous data. Exploiting the fact that very realistic data can be modeled by generative models (such as GANs), which are theoretically concentrated random vectors, we introduce a joint random matrix and concentration of measure theory for data processing. Specifically, we present fundamental random matrix results for concentrated random vectors, which we apply to the performance estimation of spectral clustering on real image datasets.

The talk will describe how ideas from random matrix theory can be leveraged to effectively, accurately, and reliably solve important problems that arise in data analytics and large scale matrix computations. We will focus in particular on accelerated techniques for computing low rank approximations to matrices. These techniques rely on randomised embeddings that reduce the effective dimensionality of intermediate steps in the computation. The resulting algorithms are particularly well suited for processing very large data sets.

The algorithms described are supported by rigorous analysis that depends on probabilistic bounds on the singular values of rectangular Gaussian matrices. The talk will briefly review some representative results.

Note: There is a related talk in the Computational Mathematics and Applications seminar on Thursday Feb 27, at 14:00 in L4. There, the ideas introduced in this talk will be extended to the problem of solving large systems of linear equations.

We construct a functor from arithmetic schemes (and dominant morphisms) to dynamical systems which allows to recover the Hasse-Weil zeta function of a scheme as a Ruelle type zeta function of the corresponding dynamical system. We state some further properties of this correspondence and explain the relation to the work of Kucharczyk and Scholze who realize the Galois groups of fields containing all roots of unity as (etale) fundamental groups of certain topological spaces. We also explain the main reason why our dynamical systems are not yet the right ones and in what regard they need to be refined.
 

One can study periods of algebraic varieties by a process of "fibering out" in which the variety is fibred over a punctured curve $f:X->U$. I will explain this process and how it leads to the classical Picard Fuchs (or Gauss-Manin) differential equations. Periods are computed by integrating solutions of Picard Fuchs over suitable closed paths on $U$. One can also couple (i.e.tensor) the Picard Fuchs connection to given connections on $U$. For example, $t^s$ with $t$ a unit on $U$ and $s$ a parameter is a solution of the connection on $\mathscr{O}_U$ given by $\nabla(1) = sdt/t$. Our "periods" become integrals over suitable closed chains on $U$ of $f(t)t^sdt/t$. Golyshev called the resulting functions of $s$ "motivic Gamma functions". 
Golyshev and Zagier studied certain special Picard Fuchs equations for their proof of the Gamma conjecture in mirror symmetry in the case of Picard rank 1. They write down a generating series, the Apéry series, the knowledge of the first few terms of which implied the gamma conjecture. We show their Apéry series is the Taylor series of a product of the motivic Gamma function times an elementary function of $s$. In particular, the coefficients of the Apéry series are periods up to inverting $2\pi i$. We relate these periods to periods of the limiting mixed Hodge structure at a point of maximal unipotent monodromy. This is joint work with M. Vlasenko. 
 

Consider a random N by N unitary matrix chosen according to Haar measure. A classical result of Diaconis and Shashahani shows that traces of low powers of this matrix tend in distribution to independent centered gaussians as N grows. A result of Johansson shows that this convergence is very fast -- superexponential in fact. Similar results hold for other classical compact groups. This talk will discuss analogues of these results for N by N matrices taken from a classical group over a finite field, showing that as N grows, traces of powers of these matrices equidistribute superexponentially. A little surprisingly, the proof is connected to the distribution in short intervals of certain arithmetic functions in F_q[T]. This is joint work with O. Gorodetsky.

It is known that random matrix distributions such as those that describe the largest eignevalue of the Gaussian Orthogonal and Symplectic ensembles (GOE, GSE) admit two types of representations: one in terms of a Fredholm Pfaffian and one in terms of a Fredholm determinant. The equality of the two sets of expressions has so far been established via involved computations of linear algebraic nature. We provide a structural explanation of this duality via links (old and new) between the model of last passage percolation and the irreducible characters of classical groups, in particular the general linear, symplectic and orthogonal groups, and by studying, combinatorially, how their representations decompose when restricted to certain subgroups. Based on joint work with Elia Bisi.

World wide, unconstrained lava flows kill people almost each year and cause extensive damage, costing millions of pounds. Defending against lava flows is possible by using topographic variations sensibly, placing buildings considerately, constructing defending walls of appropriate size and the like. Hinton, Hogg and Huppert have recently published three rather mathematical papers outlining how viscous flows down slopes interact with a variety of geometrical shapes; evaluating, in particular, the conditions under which “dry zones” form – safe places for people and belongings – and the size of a protective wall required to defend a given size building.

Following a desktop experimental demonstration, we will discuss these analyses and their consequences.

The smooth mapping class group of the 4-sphere is pi_0 of the space of orientation preserving self-diffeomorphisms of S^4. At the moment we have no idea whether this group is trivial or not. Watanabe has shown that higher homotopy groups can be nontrivial. Inspired by Watanabe's constructions, we'll look for interesting self-diffeomorphisms of S^4. Most of the talk will be an outline for a program to find a nice geometric generating set for this mapping class group; a few small steps in the program are actually theorems. The point of finding generators is that if they are explicit enough then you have a hope of either showing that they are all trivial or finding an invariant that is well adapted to obstructing triviality of these generators.