Previous Conferences & Workshops

Let $A$ be an abelian variety over a number field $E\subset \mathbb{C}$ and let $v$ be a place of good reduction lying over a prime $p$. For a prime $\ell\neq p$, a result of Deligne implies that upon replacing $E$ by a finite extension, the Galois...

Some believe that truly effective and efficient reinforcement learning algorithms must explicitly construct and explicitly reason with models that capture the causal structure of the world. In short, model-based reinforcement learning is not...

In this talk I will first recall three classical theorems in the theory of finite dimensional Hamiltonian systems, then I will use the periodic nonlinear Schrodinger equation as an example of an infinite dimensional Hamiltonian system and I will...

In this talk I will discuss two lines of work involving learning in the presence of biased data and strategic behavior. In the first, we ask whether fairness constraints on learning algorithms can actually improve the accuracy of the classifier...

Let f be a polynomial over the complex numbers with an isolated singular point at the origin and let d be a positive integer. To such a polynomial we can assign a variety called the dth contact locus of f. Morally, this corresponds to the space of d...

Fekete (1923) discovered the notion of transfinite diameter while studying the possible configurations of Galois orbits of algebraic integers in the complex plane. Based purely on the fact that the discriminants of monic integer irreducible...

Langevin diffusions are continuous-time stochastic processes that are based on the gradient of a potential function. As such they have many connections---some known and many still to be explored---to gradient-based machine learning. I'll discuss...

Large-scale vision benchmarks have driven---and often even defined---progress in machine learning. However, these benchmarks are merely proxies for the real-world tasks we actually care about. How well do our benchmarks capture such tasks?

In this...

Morgan Weiler, Rice University:Infinite staircases of symplectic embeddings of ellipsoids into Hirzebruch surfaces

Gromov nonsqueezing tells us that symplectic embeddings are governed by more complex obstructions than volume. In particular, in...

One of the fundamental challenges in number theory is to understand the intricate way in which the additive and multiplicative structures in the integers intertwine. We will explore a dynamical approach to this topic. After introducing a new...