Mon, 04 Mar 2019
14:15
L4

Structural results in wrapped Floer theory

John Pardon
(Princeton)
Abstract

I will discuss results relating different partially wrapped Fukaya categories.  These include a K\"unneth formula, a `stop removal' result relating partially wrapped Fukaya categories relative to different stops, and a gluing formula for wrapped Fukaya categories.  The techniques also lead to generation results for Weinstein manifolds and for Lefschetz fibrations.  The methods are mainly geometric, and the key underlying Floer theoretic fact is an exact triangle in the Fukaya category associated to Lagrangian surgery along a short Reeb chord at infinity.  This is joint work with Sheel Ganatra and Vivek Shende.

Mon, 04 Mar 2019

13:00 - 14:00
N3.12

Mathematrix - Panel on mental health with Sandy Patel and Tim Knowlson

Further Information

We are very excited to have another session with invited speakers joining us for the lunch next week. Sandy Patel and Dr. Timothy Knowlson, Oxford's Peer Support Programme Coordinator, will be joining us for a panel discussion on mental health in academia. 

This will be a great opportunity to learn about what support is available, what are the common issues faced by postgrads in our department and how we can help ourselves and each other. All are welcome to join us and to ask questions.

We hope to see many of you at the (free) lunch - Monday 1-2pm Quillen Room (N3.12).

Mon, 04 Mar 2019
12:45
L5

Gauge Theory and Boundary Integrability

David Skinner
(Cambridge)
Abstract

Costello Yamazaki and Witten have proposed a new understanding of quantum integrable systems coming from a variant of Chern-Simons theory living on a product of two Riemann surfaces. I’ll review their work, and show how it can be extended to the case of integrable systems with boundary. The boundary Yang-Baxter Equations, twisted Yangians and Sklyanin determinants all have natural interpretations in terms of line operators in the theory.

Fri, 01 Mar 2019
16:00
L1

Maths meets Computer Vision

Further Information

Speaker 1: Pawan Kumar
Title: Neural Network Verification
Abstract: In recent years, deep neural networks have started to find their way into safety critical application domains such as autonomous cars and personalised medicine. As the risk of an error in such applications is very high, a key step in the deployment of neural networks is their formal verification: proving that a network satisfies a desirable property, or providing a counter-example to show that it does not. In this talk, I will formulate neural network verification as an optimization problem, briefly present the existing branch-and-bound style algorithms to compute a globally optimal solution, and highlight the outstanding mathematical challenges that limit the size of problems we can currently solve.

Speaker 2: Samuel Albanie
Title: The Design of Deep Neural Network Architectures: Exploration in a High-Dimensional Search Space
Abstract: Deep Neural Networks now represent the dominant family of function approximators for tackling machine perception tasks. In this talk, I will discuss the challenges of working with the high-dimensional design space of these networks. I will describe several competing approaches that seek to fully automate the network design process and the open mathematical questions for this problem.

Fri, 01 Mar 2019

14:00 - 15:00
L1

Mathematics: the past, present and future - "Polynomials"

Prof Nick Trefethen
Abstract

Polynomials have been at the heart of mathematics for a millennium, yet when it comes to applying them, there are many puzzles and surprises. Among others, our tour will visit Newton, Lagrange, Gauss, Galois, Runge, Bernstein, Clenshaw and Chebfun (with a computer demo).

Fri, 01 Mar 2019

12:00 - 13:00
L4

Modular, Infinite, and Other Deep Generative Models of Data

Charles Sutton
(University of Edinburgh)
Abstract

Deep generative models provide powerful tools for fitting difficult distributions such as modelling natural images. But many of these methods, including  variational autoencoders (VAEs) and generative adversarial networks (GANs), can be notoriously difficult to fit.

One well-known problem is mode collapse, which means that models can learn to characterize only a few modes of the true distribution. To address this, we introduce VEEGAN, which features a reconstructor network, reversing the action of the generator by mapping from data to noise. Our training objective retains the original asymptotic consistency guarantee of GANs, and can be interpreted as a novel autoencoder loss over the noise.

Second, maximum mean discrepancy networks (MMD-nets) avoid some of the pathologies of GANs, but have not been able to match their performance. We present a new method of training MMD-nets, based on mapping the data into a lower dimensional space, in which MMD training can be more effective. We call these networks Ratio-based MMD Nets, and show that somewhat mysteriously, they have dramatically better performance than MMD nets.

A final problem is deciding how many latent components are necessary for a deep generative model to fit a certain data set. We present a nonparametric Bayesian approach to this problem, based on defining a (potentially) infinitely wide deep generative model. Fitting this model is possible by combining variational inference with a Monte Carlo method from statistical physics called Russian roulette sampling. Perhaps surprisingly, we find that this modification helps with the mode collapse problem as well.

 

Thu, 28 Feb 2019

16:00 - 17:00
L6

Arithmetic statistics via graded Lie algebras

Beth Romano
(University of Cambridge)
Abstract

I will talk about recent work with Jack Thorne in which we find the average size of the Selmer group for a family of genus-2 curves by analyzing a graded Lie algebra of type E_8. I will focus on the role representation theory plays in our proofs.

Thu, 28 Feb 2019

16:00 - 17:30
L4

Mean-Field Games with Differing Beliefs for Algorithmic Trading

Sebastian Jaimungal
(University of Toronto)
Abstract

Even when confronted with the same data, agents often disagree on a model of the real-world. Here, we address the question of how interacting heterogenous agents, who disagree on what model the real-world follows, optimize their trading actions. The market has latent factors that drive prices, and agents account for the permanent impact they have on prices. This leads to a large stochastic game, where each agents' performance criteria is computed under a different probability measure. We analyse the mean-field game (MFG) limit of the stochastic game and show that the Nash equilibria is given by the solution to a non-standard vector-valued forward-backward stochastic differential equation. Under some mild assumptions, we construct the solution in terms of expectations of the filtered states. We prove the MFG strategy forms an \epsilon-Nash equilibrium for the finite player game. Lastly, we present a least-squares Monte Carlo based algorithm for computing the optimal control and illustrate the results through simulation in market where agents disagree on the model.
[ joint work with Philippe Casgrain, U. Toronto ]
 

Thu, 28 Feb 2019
16:00
C3

A biased view of GRT

Filip Zivanovic
(Oxford University)
Abstract

Standard representation theory transforms groups=algebra into vector spaces = (linear) algebra. The modern approach, geometric representation theory constructs geometric objects from algebra and captures various algebraic representations through geometric gadgets/invariants on these objects. This field started with celebrated Borel-Weil-Bott and Beilinson-Bernstein theorems but equally is in rapid expansion nowadays. I will start from the very beginnings of this field and try to get to the recent developments (time permitting).

Thu, 28 Feb 2019
12:00
L4

A non-linear parabolic PDE with a distributional coefficient and its applications to stochastic analysis

Elena Issolgio
(Leeds University)
Abstract

We consider a non-linear PDE on $\mathbb R^d$ with a distributional coefficient in the non-linear term. The distribution is an element of a Besov space with negative regularity and the non-linearity is of quadratic type in the gradient of the unknown. Under suitable conditions on the parameters we prove local existence and uniqueness of a mild solution to the PDE, and investigate properties like continuity with respect to the initial condition. To conclude we consider an application of the PDE to stochastic analysis, in particular to a class of non-linear backward stochastic differential equations with distributional drivers.

Wed, 27 Feb 2019

18:00 - 21:00

OCIAM Dinner at Christ Church, Oxford

Keynote: Professor Grae Worster
(University of Cambridge)
Further Information

Here's a quick note about the location and dress code for Wednesday's OCIAM event at Christ Church.

The Lecture will take place in the Michael Dummett Lecture Theatre, which is in Blue Boar Quad at 6pm. Please enter via the lodge and ask for directions.

Pre-dinner drinks at 7:15pm and dinner at 7:45pm itself will take place in the Lee Building (in the Freind room = SCR dining room. Yes, e before i.)

Given that we will be in the SCR dining room, please dress smartly (Jacket and tie for the gents, please. No jeans.)

[[{"fid":"54605","view_mode":"preview","fields":{"format":"preview"},"link_text":"Christ Church map.pdf","type":"media","field_deltas":{"1":{"format":"preview"}},"attributes":{"class":"media-element file-preview","data-delta":"1"}}]]

Wed, 27 Feb 2019
16:00
C1

Royden's Theorem for free products

Dionysis Syrigos
(Southampton University)
Abstract

Let $G$ be a group which splits as $G = F_n * G_1 *...*G_k$, where every $G_i$ is freely indecomposable and not isomorphic to the group of integers.  Guirardel and Levitt generalised the Culler- Vogtmann Outer space of a free group by introducing an Outer space for $G$ as above, on which $\text{Out}(G)$ acts by isometries. Francaviglia and Martino introduced the Lipschitz metric for the Culler- Vogtmann space and later for the general Outer space. In a joint paper with Francaviglia and Martino, we prove that the group of isometries of the Outer space corresponding to $G$ , with respect to the Lipschitz metric, is exactly $\text{Out}(G)$. In this talk, we will describe the construction of the general Outer space and the corresponding Lipschitz metric in order to present the result about the isometries.

Wed, 27 Feb 2019
11:00
N3.12

Applying Distributional Compositional Categorical Models of Meaning to Language Translation

Brian Tyrrell
(University of Oxford)
Abstract

In 2010 Coecke, Sadrzadeh, and Clark formulated a new model of natural language which operates by combining the syntactics of grammar and the semantics of individual words to produce a unified ''meaning'' of sentences. This they did by using category theory to understand the component parts of language and to amalgamate the components together to form what they called a ''distributional compositional categorical model of meaning''. In this talk I shall introduce the model of Coecke et. al., and use it to compare the meaning of sentences in Irish and in English (and thus ascertain when a sentence is the translation of another sentence) using a cosine similarity score.

The Irish language is a member of the Gaelic family of languages, originating in Ireland and is the official language of the Republic of Ireland.

Tue, 26 Feb 2019
16:00
L1

Geometric model theory in separably closed valued fields

Martin Hils
(University of Muenster)
Further Information

joint work with Moshe Kamensky and Silvain Rideau

Abstract

Let $p$ be a fixed prime number and let $SCVF_p$ be the theory of separably closed non-trivially valued fields of
characteristic $p$. In the talk, we will see that, in many ways, the step from $ACVF_{p,p}$ to $SCVF_p$ is not more
complicated than the one from $ACF_p$ to $SCF_p$.

At a basic level, this is true for quantifier elimination (Delon), for which it suffices to add parametrized $p$-coordinate
functions to any of the usual languages for valued fields. It follows that all completions are NIP.

At a more sophisticated level, in finite degree of imperfection, when a $p$-basis is named or when one just works with
Hasse derivations, the imaginaries of $SCVF_p$ are not more complicated than the ones in $ACVF_{p,p}$, i.e., they are
classified by the geometric sorts of Haskell-Hrushovski-Macpherson. The latter is proved using prolongations. One may
also use these to characterize the stable part and the stably dominated types in $SCVF_p$, and to show metastability.

Tue, 26 Feb 2019

15:30 - 16:30
L4

Field and Vertex algebras from geometry and topology

Sven Meinhardt
(Sheffield)
Abstract

I will explain the notion of a singular ring and sketch how singular rings provide field and vertex algebras introduced by Borcherds and Kac. All of these notions make sense in general symmetric monoidal categories and behave nicely with respect to symmetric lax monoidal functors. I will provide a complete classification of singular rings if the tensor product is a cartesian product. This applies in particular to categories of topological spaces or (algebraic) stacks equipped with the usual cartesian product. Moduli spaces provide a rich source of examples of singular rings. By combining these ideas, we obtain vertex and field algebras for each reasonable moduli space and each choice of an orientable homology theory. This generalizes a recent construction of vertex algebras by Dominic Joyce.

Tue, 26 Feb 2019

14:30 - 15:00
L3

Multispectral snapshot demosaicing via non-convex matrix completion

Simon Vary
(Oxford)
Abstract

Snapshot mosaic multispectral imagery acquires an undersampled data cube by acquiring a single spectral measurement per spatial pixel. Sensors which acquire p frequencies, therefore, suffer from severe 1/p undersampling of the full data cube.  We show that the missing entries can be accurately imputed using non-convex techniques from sparse approximation and matrix completion initialised with traditional demosaicing algorithms.

Tue, 26 Feb 2019

14:30 - 15:30
L6

Graphons with minimum clique density

Maryam Sharifzadeh
Further Information

Among all graphs of given order and size, we determine the asymptotic structure of graphs which minimise the number of $r$-cliques, for each fixed $r$. In fact, this is achieved by characterising all graphons with given density which minimise the $K_r$-density. The case $r=3$ was proved in 2016 by Pikhurko and Razborov.

 

This is joint work with H. Liu, J. Kim, and O. Pikhurko.

Tue, 26 Feb 2019
14:15
L4

Kac-Moody correction factors and Eisenstein series

Thomas Oliver
(Oxford)
Abstract

Formally, the Fourier coefficients of Eisenstein series on Kac-Moody groups contain as yet mysterious automorphic L-functions relevant to open conjectures such as that of Ramanujan and Langlands functoriality. In this talk, we will consider the constant Fourier coefficient, if it even makes sense rigorously, and its relationship to the geometry and combinatorics of a Kac-Moody group. Joint work with Kyu-Hwan Lee.

 

Tue, 26 Feb 2019

14:00 - 14:30
L3

New mixed finite element methods for natural convection with phase-change in porous media

Bryan Gómez Vargas
(Conception)
Abstract

This talk is concerned with the mathematical and numerical analysis of a steady phase change problem for non-isothermal incompressible viscous flow. The system is formulated in terms of pseudostress, strain rate and velocity for the Navier-Stokes-Brinkman equation, whereas temperature, normal heat flux on the boundary, and an auxiliary unknown are introduced for the energy conservation equation. In addition, and as one of the novelties of our approach, the symmetry of the pseudostress is imposed in an ultra-weak sense, thanks to which the usual introduction of the vorticity as an additional unknown is no longer needed. Then, for the mathematical analysis two variational formulations are proposed, namely mixed-primal and fully-mixed approaches, and the solvability of the resulting coupled formulations is established by combining fixed-point arguments, Sobolev embedding theorems and certain regularity assumptions. We then construct corresponding Galerkin discretizations based on adequate finite element spaces, and derive optimal a priori error estimates. Finally, numerical experiments in 2D and 3D illustrate the interest of this scheme and validate the theory.

Tue, 26 Feb 2019

12:00 - 13:15
L4

Higgsplosion: excitements and problems

Alexander Belyaev
(Southampton University)
Abstract

A recent calculation of the multi-Higgs boson production in scalar theories
with spontaneous symmetry breaking has demonstrated the fast growth of the
cross section with the Higgs multiplicity at sufficiently large energies,
called “Higgsplosion”. It was argued that “Higgsplosion” solves the Higgs
hierarchy and fine-tuning problems. The phenomena looks quite exciting,
however in my talk I will present arguments that: a) the formula for
“Higgsplosion” has a limited applicability and inconsistent with unitarity
of the Standard Model; b) that the contribution from “Higgsplosion” to the
imaginary part of the Higgs boson propagator cannot be re-summed in order to
furnish a solution of the Higgs hierarchy and fine-tuning problems.

Based on our recent paper https://arxiv.org/abs/1808.05641 (A. Belyaev, F. Bezrukov, D. Ross)

 

Mon, 25 Feb 2019

16:00 - 17:00
L4

Diffeomorphic Approximation of W^{1,1} Planar Sobolev Homeomorphisms

Stanislav Hencl
(Charles University in Prague)
Abstract

Let $\Omega\subseteq\mathbb{R}^2$ be a domain and let $f\in W^{1,1}(\Omega,\mathbb{R}^2)$ be a homeomorphism (between $\Omega$ and $f(\Omega)$). Then there exists a sequence of smooth diffeomorphisms $f_k$ converging to $f$ in $W^{1,1}(\Omega,\mathbb{R}^2)$ and uniformly. This is a joint result with A. Pratelli.