Previous Conferences & Workshops

Apr
13
2020

Computer Science/Discrete Mathematics Seminar I

Legal Theorems of Privacy
Kobbi Nissim
11:00am|https://theias.zoom.us/j/360043913

There are significant gaps between legal and technical thinking around data privacy. Technical standards such as k-anonymity and differential privacy are described using mathematical language whereas legal standards are not rigorous from a...

Apr
13
2020

Analysis Seminar

Flows of vector fields: classical and modern
Camillo DeLellis
11:00am|https://theias.zoom.us/j/373002666

Consider a (possibly time-dependent) vector field $v$ on the Euclidean space. The classical Cauchy-Lipschitz (also named Picard-Lindel\"of) Theorem states that, if the vector field $v$ is Lipschitz in space, for every initial datum $x$ there is a...

Apr
10
2020

Symplectic Seminar

Geometry of Quantum Uncertainty
Leonid Polterovich
9:00am|https://princeton.zoom.us/j/745635914

Compatible almost-complex structures on symplectic manifolds correspond to optimal quantizations. I will discuss this statement (joint with Louis Ioos and David Kazhdan), as well as some other geometric facets of uncertainty principles in quantum...

Apr
09
2020

Mathematical Conversations

Consequences of delays and imperfect isolation in epidemic control
Lai-Sang Young
5:30pm|Remote Access Only

 

In the absence of a vaccine, isolation is about the only available means to control an epidemic. I would like to share with everyone some things I learned from a project I worked on a few years ago studying the consequences of delays and...

Apr
09
2020

Joint IAS/Princeton University Number Theory Seminar

On the Kudla-Rapoport conjecture
4:30pm|https://theias.zoom.us/j/959183254

The Kudla-Rapoport conjecture predicts a precise identity between the arithmetic intersection number of special cycles on unitary Rapoport-Zink spaces and the derivative of local representation densities of hermitian forms. It is a key local...

Apr
09
2020

Theoretical Machine Learning Seminar

Meta-Learning: Why It’s Hard and What We Can Do
3:00pm|https://theias.zoom.us/j/384099138

Meta-learning (or learning to learn) studies how to use machine learning to design machine learning methods themselves. We consider an optimization-based formulation of meta-learning that learns to design an optimization algorithm automatically...

Apr
07
2020

Theoretical Machine Learning Seminar

Interpolation in learning: steps towards understanding when overparameterization is harmless, when it helps, and when it causes harm
Anant Sahai
12:00pm|https://theias.zoom.us/j/384099138

A continuing mystery in understanding the empirical success of deep neural networks has been in their ability to achieve zero training error and yet generalize well, even when the training data is noisy and there are many more parameters than data...

Apr
07
2020

Computer Science/Discrete Mathematics Seminar II

Primality testing
Andrey Kupavskii
10:30am|https://theias.zoom.us/j/360043913

In the talk, I will explain the algorithm (and its analysis) for testing whether a number is a prime, invented by Agrawal, Kayal, and Saxena.

Apr
06
2020

Members’ Seminar

The Palais-Smale Theorem and the Solution of Hilbert’s 23 Problem
2:00pm|http://theias.zoom.us/j/119412864

Hilbert’s 23rd Problem is the last in his famous list of problems and is of a different character than the others. The description is several pages, and basically says that the calculus of variations is a subject which needs development. We will...

Apr
06
2020

Computer Science/Discrete Mathematics Seminar I

Borrowing memory that's being used: catalytic approaches to the Tree Evaluation Problem
James Cook
11:00am|https://theias.zoom.us/j/360043913

I'll be presenting some joint work with Ian Mertz scheduled to appear at STOC 2020. The study of the Tree Evaluation Problem (TEP), introduced by S. Cook et al. (TOCT 2012), is a promising approach to separating L from P. Given a label in [k] at...