Previous Conferences & Workshops

Apr
03
2020

Symplectic Seminar

The Simplicity Conjecture
Daniel Cristofaro-Gardiner
9:00am|https://zoom.us/j/496042680

I will explain recent joint work proving that the group of compactly supported area preserving homeomorphisms of the two-disc is not a simple group; this answers the ”Simplicity Conjecture” in the affirmative. Our proof uses new spectral invariants...

Apr
02
2020

Joint IAS/Princeton University Number Theory Seminar

Density conjecture for horizontal families of lattices in SL(2)
4:30pm|https://theias.zoom.us/j/959183254

Let G be a real semi-simple Lie group with an irreducible unitary representation \pi. The non-temperedness of \pi is measured by the parameter p(\pi) which is defined as the infimum of p\geq 2 such that \pi has matrix coefficients in L^p(G). Sarnak...

Apr
02
2020

Theoretical Machine Learning Seminar

Learning Controllable Representations
12:00pm|https://theias.zoom.us/j/384099138

As deep learning systems become more prevalent in real-world applications it is essential to allow users to exert more control over the system. Exerting some structure over the learned representations enables users to manipulate, interpret, and even...

Mar
31
2020

Theoretical Machine Learning Seminar

Some Recent Insights on Transfer Learning
12:00pm|https://theias.zoom.us/j/384099138

A common situation in Machine Learning is one where training data is not fully representative of a target population due to bias in the sampling mechanism or high costs in sampling the target population; in such situations, we aim to ’transfer’...

Mar
31
2020

Computer Science/Discrete Mathematics Seminar II

High dimensional expansion and agreement testing
10:30am|https://theias.zoom.us/j/360043913

In this talk I will describe the notion of "agreement tests" that are motivated by PCPs but stand alone as a combinatorial property-testing question. I will show that high dimensional expanders support agreement tests, thereby derandomizing direct...

Mar
30
2020

Computer Science/Discrete Mathematics Seminar I

CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
Oded Regev and Sivakanth Gopi
11:00am|https://theias.zoom.us/j/360043913

A theorist's dream is to show that hard instances/obstructions for an (optimal) algorithm can be used as gadgets to prove tight hardness reductions (which proves optimality of the algorithm). An example of such a result is that of Prasad Raghavendra...

Mar
27
2020

Symplectic Seminar

Fragmentation pseudo-metrics and Lagrangian submanifolds
Octav Cornea
9:00am|https://zoom.us/j/496042680

The purpose of the talk is to discuss a class of pseudo-metrics that can be defined on the set of objects of a triangulated category whose morphisms are endowed with a notion of weight. In case the objects are Lagrangian submanifolds (possibly...

Mar
26
2020

Joint IAS/Princeton University Number Theory Seminar

Wiles defect for Hecke algebras that are not complete intersections
4:30pm|https://theias.zoom.us/j/280491607

In his work on modularity theorems, Wiles proved a numerical criterion for a map of rings R->T to be an isomorphism of complete intersections. In addition to proving modularity theorems, this numerical criterion also implies a connection between the...

Mar
26
2020

Theoretical Machine Learning Seminar

Margins, perceptrons, and deep networks
Matus Telgarsky
12:00pm|https://illinois.zoom.us/j/741628827

This talk surveys the role of margins in the analysis of deep networks. As a concrete highlight, it sketches a perceptron-based analysis establishing that shallow ReLU networks can achieve small test error even when they are quite narrow, sometimes...