Peter K. Friz (Technische Universität Berlin)
Rough Analysis and Applications (ONLINE) abstract
Abstract:
We plan to discuss: the algebra of iterated integrals, signatures and expected signatures, rough paths and models; Kolmogorov type criteria; Schauder estimates; p-variation, abstract Riemann-Stieltjes integration (Sewing); rough integration and reconstruction; a paracontrolled view; rough differential equations and flows; rough transport equations; second order rough partial differential equations; rough volatility; a regularity structure view; large deviations and precise asymptotics for rough volatility.A good part of the lecture will follow F-Hairer (2014,2020).
10:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room
Edoardo Dotti (Uni Fribourg)
CANCELLED: Title T.B.A.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Onlline Seminar
Anina Gruica
eSeminar: MDP Convolutional Codes over \\(\\mathbb{Z}_{p^r}\\) abstract
Abstract:
Maximum distance profile (MDP) convolutional codes are characterized by the property that their column distances are maximal among all codes of the same rate and degree, and they have the ability to correct a maximal number of errors per time interval. Over finite fields, MDP convolutional codes have been studied widely and several constructions have been presented. Most of these constructions are based on a well-known algebraic characterization of their truncated sliding generator matrices. This characterization gives a criterion, which says that a left-prime polynomial matrix of fixed size is a generator matrix of an MDP convolutional code, if all the full-size minors of the truncated sliding generator matrix, that are nontrivially zero, are nonzero. In this presentation, my main focus lies on MDP convolutional codes over \\(\\mathbb{Z}_{p^r}\\). There are several problems we encounter when defining convolutional codes over \\(\\mathbb{Z}_{p^r}\\), one of them being that submodules of \\(\\mathbb{Z}_{p^r}^n[z]\\) do not necessarily have a basis. For this reason, I will present the necessary theory on submodules of \\(\\mathbb{Z}_{p^r}^n[z]\\), in order to be able to define an alternative for a basis, which is called \\(p\\)-basis. With this \\(p\\)-basis, we get an analogue of a generator matrix and we can analyse column distance properties of convolutional codes over \\(\\mathbb{Z}_{p^r}\\) linked to their truncated sliding generator matrices. Not very long ago upper bounds for column distances of convolutional codes over \\(\\mathbb{Z}_{p^r}\\) have been derived. Using these upper bounds and the concept of \\(p\\)-encoders we give an analogue of the characterization of MDP convolutional codes over finite fields for MDP convolutional codes over \\(\\mathbb{Z}_{p^r}\\). In particular, we present a construction of MDP convolutional codes over \\(\\mathbb{Z}_{p^r}\\) based on this characterization and the novel notion of \\(p\\)-superregular matrices.
15:00 • Onlline Seminar
Peter Haïssinski (Université d\'Aix-Marseille)
CANCELLED: Title T.B.A.
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Philippe Rigollet (Massachusetts Institute of Technology (MIT), Cambridge, USA)
Statistical and Computational aspects of Wasserstein Barycenters abstract
Abstract:
The notion of average is central to most statistical methods. In this talk we study a generalization of this notion over the non-Euclidean space of probability measures equipped with a certain Wasserstein distance. This generalization is often called Wasserstein Barycenters and empirical evidence suggests that these barycenters allow to capture interesting notions of averages in graphics, data assimilation and morphometrics. However the statistical (rates of convergence) and computational (efficient algorithms) for these Wasserstein barycenters are largely unexplored. The goal of this talk is to review two recent results:1. Fast rates of convergence for empirical barycenters in general geodesic spaces, and,2. Provable guarantees for gradient descent and stochastic gradient descent to compute Wasserstein barycenters.Both results leverage geometric aspects of optimal transport.Based on joint works (arXiv:1908.00828, arXiv:2001.01700) with Chewi, Le Gouic, Maunu, Paris, and Stromme.
TBA
Title T.B.A.
16:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43