Previous Conferences & Workshops

In this talk, I'll illustrate how to lift a "small" locally testable code via a high dimensional expander (HDX) to a "large" locally testable code. Given a D-left regular bipartite graph G = ([n], [m], E) and a "small" code C \in {0,1}^D, the Tanner...

In this talk I will discuss some definitions of exponential mixing and other rates of mixing and discuss some of its consequences.

We will discuss the problem of constructing and characterizing uniquely, integral models of Shimura varieties over some primes where non-smooth reduction is expected.

A main theme in extremal combinatorics is about asking when the random construction is close to optimal. A famous conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if $H$ is a bipartite graph, then the random graph with edge density $p$...

The unique games conjecture gives a very strong PCP theorem, which, if true, leads to a clean understanding of a broad family of approximation problems. We will describe recent progress on the conjecture and how certain type of expansion and...

Minimax optimization, especially in its general nonconvex formulation, has found extensive applications in modern machine learning, in settings such as generative adversarial networks (GANs) and adversarial training. It brings a series of unique...

High dimensional expansion generalizes edge and spectral expansion in graphs to higher dimensional hypergraphs or simplicial complexes. Unlike for graphs, it is exceptionally rare for a high dimensional complex to be both sparse and expanding. The...