Hamiltonian classification and unlinkedness of fibres in cotangent bundles of Riemann surfaces

Georgios Dimitroglou Rizell
Uppsala University
September 4, 2020
In a joint work with Laurent Côté we show the following result. Any Lagrangian plane in the cotangent bundle of an open Riemann surface which coincides with a cotangent fibre outside of some compact subset, is compactly supported Hamiltonian isotopic to that fibre. This result implies Hamiltonian unlinkedness for Lagrangian links in the cotangent bundle of a (possibly closed Riemann surface whose components are Hamiltonian isotopic to fibres.

Partition functions of the tensionless string

Lorenz Eberhardt
Member, School of Natural Sciences, Institute for Advanced Study
August 28, 2020
I discuss string theory on AdS3xS3xT4 in the tensionless limit, with one unit of NS-NS flux. This theory is conjectured to be dual to the symmetric product orbifold CFT. I show how to compute the full string partition function on various locally AdS3 backgrounds, such as thermal AdS3, the BTZ black and conical defects, and find that it is independent of the actual background, but only depends on the boundary geometry.

Multi-Output Prediction: Theory and Practice

Inderjit Dhillon
University of Texas, Austin
August 27, 2020
Many challenging problems in modern applications amount to finding relevant results from an enormous output space of potential candidates, for example, finding the best matching product from a large catalog or suggesting related search phrases on a search engine. The size of the output space for these problems can be in the millions to billions. Moreover, observational or training data is often limited for many of the so-called “long-tail” of items in the output space.

Learning-Based Sketching Algorithms

Piotr Indyk
Massachusetts Institute of Technology
August 25, 2020
Classical algorithms typically provide "one size fits all" performance, and do not leverage properties or patterns in their inputs. A recent line of work aims to address this issue by developing algorithms that use machine learning predictions to improve their performance. In this talk I will present two examples of this type, in the context of streaming and sketching algorithms.

An update on exact WKB and supersymmetric field theory

Andy Neitzke
Yale University
August 24, 2020
Over the last decade it has become clear that there is a close connection between the BPS sector of N=2 supersymmetric field theories in four dimensions and the exact WKB method for analysis of ordinary differential equations (Schrodinger equations and their higher-order analogues). I will review the basic players in this story and some of the main results, and describe some outstanding puzzles.

Event Sequence Modeling with the Neural Hawkes Process

Jason Eisner
Johns Hopkins University
August 20, 2020
Suppose you are monitoring discrete events in real time. Can you predict what events will happen in the future, and when? Can you fill in past events that you may have missed? A probability model that supports such reasoning is the neural Hawkes process (NHP), in which the Poisson intensities of K event types at time t depend on the history of past events. This autoregressive architecture can capture complex dependencies. It resembles an LSTM language model over K word types, but allows the LSTM state to evolve in continuous time.