Joachim Kock (Universitat Autònoma de Barcelona)
Infinity-operads as polynomial monads abstract
Abstract:
I’ll present a new model for ∞-operads, namely as analytic monads. In the ∞-world (unlike what happens in the classical case), analytic functors are polynomial, and therefore the theory can be developed within the setting of polynomial functors. I’ll talk about some of the features of this theory, and explain a nerve theorem, which implies that the ∞-category of analytic monads is equivalent to the ∞-category of dendroidal Segal spaces of Cisinski and Moerdijk, one of the known equivalent models for ∞-operads. This is joint work with David Gepner and Rune Haugseng.
10:15 • EPF Lausanne, Salle CM 1 113
Victorita Dolean (University of Strathclyde)
Hybrid discontinuous Galerkin discretisations and domain decomposition preconditioners for the Stokes problem abstract
Abstract:
Solving the Stokes equation by an optimal domain decomposition method derived algebraically involves the use of nonstandard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as hybrid discontinuous Galerkin appears as an appropriate strategy: on the one hand they provide the best compromise in terms of the number of degrees of freedom in between standard continuous and discontinuous Galerkin methods, and on the other hand the degrees of freedom used in the nonstandard interface conditions are naturally needed at the boundary between elements. In this work, we introduce the coupling between a well chosen discretisation method (hybrid discontinuous Galerkin) and a novel and efficient domain decomposition method to solve the Stokes system. We present the detailed analysis of the hybrid discontinuous Galerkin method for the Stokes problem with nonstandard boundary conditions. The full stability and convergence analysis of the discretisation method is presented, and the results are corroborated by numerical experiments. In addition, the advantage of the new preconditioners over more classical choices is also supported by numerical experiments.
14:00 • Université de Genève, Section Mathématiques, Centre Acacias II, Salle 623
Dr. Gabriel Peyré (École Normale Supérieure, Paris)
Optimal Transport for Machine Learning abstract
Abstract:
Optimal transport (OT) has become a fundamental mathematical tool at the interface between calculus of variations, partial differential equations and probability. It took however much more time for this notion to become mainstream in numerical applications. This situation is in large part due to the high computational cost of the underlying optimization problems. There is a recent wave of activity on the use of OT-related methods in fields as diverse as image processing, computer vision, computer graphics, statistical inference, machine learning.
In this talk, I will review an emerging class of numerical approaches for the approximate resolution of OT-based optimization problems. This offers a new perspective for the application of OT in high dimension, to solve supervised (learning with transportation loss function) and unsupervised (generative network training) machine learning problems.
More information and references can be found on the website of our book "Computational Optimal Transport" https://optimaltransport.github.io/
To register to the talk, use the following link: https://www.idiap.ch/talk/otml
16:00 • Idiap Research Institute Martigny, Location of the talk: Centre du Parc, Rue Marconi 19, CH-1920 Martigny