Previous Conferences & Workshops

Feb
06
2020

Special Computer Science/Discrete Mathematics Seminar

Explicit rigid matrices in P^NP via rectangular PCPs
Prahladh Harsha
2:00pm|Simonyi 101

A nxn matrix M over GF(2) is said to be (r,\delta)-rigid if every matrix M' within \delta n^2 Hamming distance from M has rank at least r. A long standing open problem is to construct explicit rigid matrices. In a recent remarkable result, Alman and...

Feb
06
2020

Theoretical Machine Learning Seminar - PCTS Seminar Series: Deep Learning for Physics

Understanding Machine Learning via Exactly Solvable Statistical Physics Models
Lenka Zdeborova
11:45am|Jadwin Hall PCTS Seminar Room 407 (Princeton University)

Please Note: The seminars are not open to the general public, but only to active researchers.

Register here for this event: https://docs.google.com/forms/d/e/1FAIpQLScJ-BUVgJod6NGrreI26pedg8wGEyPhh3WMDskE1hIac_Yp3Q/viewform

The affinity between...

Feb
06
2020

PCTS Seminar Series: Deep Learning for Physics

Topic #1: Understanding Machine Learning via Exactly Solvable Statistical Physics Models; Topic #2: Dynamics of Generalization in Overparameterized Neural Networks
Speaker #1: Lenka Zdeborova; Speaker #2: Andrew Saxe
11:45am|Jadwin Hall, PCTS Seminar Room 407, 4th Floor

Please Note: The seminars are not open to the general public, but only to active researchers. Register here for this event: https://docs.google.com/forms/d/e/1FAIpQLScJ-BUVgJod6NGrreI26pedg8wGEyP… Abstract for talk #1: The affinity between...

Feb
05
2020

Mathematical Conversations

Anosov flows in 3-manifolds and the fundamental group
6:00pm|Dilworth Room

The goal of the talk is to explain the statement and proof of a beautiful result due to Margulis (1967) later extended by Plante and Thurston (1972) that imposes restrictions on the growth of the fundamental group of 3-manifolds that support Anosov...

Feb
04
2020

Theoretical Machine Learning Seminar

Algorithm and Hardness for Kernel Matrices in Numerical Linear Algebra and Machine Learning
12:00pm|Dilworth Room

For a function K : R^d x R^d -> R, and a set P = {x_1, ..., x_n} in d-dimension, the K graph G_P of P is the complete graph on n nodes where the weight between nodes i and j is given by K(x_i, x_j). In this paper, we initiate the study of when...

Feb
04
2020

Computer Science/Discrete Mathematics Seminar II

Proofs, Circuits, Communication, and Lower Bounds in Complexity Theory
10:30am|Simonyi Hall 101

Many of the central problems in computational complexity revolve around proving lower bounds on the amount of resources used in various computational models. In this series of talks, we will discuss three standard objects in computational complexity...

Feb
03
2020

Analysis Seminar

When do interacting organisms gravitate to the vertices of a regular simplex?
Robert McCann
5:00pm|Simonyi Hall 101

Flocking and swarming models which seek to explain pattern formation in mathematical biology often assume that organisms interact through a force which is attractive over large distances yet repulsive at short distances. Suppose this force is given...

Feb
03
2020

Symplectic Dynamics/Geometry Seminar

Counting embedded curves in symplectic 6-manifolds
Aleksander Doan
3:30pm|Simonyi Hall 101

The number of embedded pseudo-holomorphic curves in a symplectic manifold typically depends on the choice of an almost complex structure on the manifold and so does not lead to a symplectic invariant. However, I will discuss two instances in which...

Feb
03
2020

Members’ Seminar

Coarse dynamics and partially hyperbolic diffeomorphisms in 3-manifolds
2:00pm|Simonyi Hall 101

The purpose of this talk is to introduce the classification problem of partially hyperbolic diffeomorphisms in dimension 3 (including introducing the concept of partially hyperbolic diffeomorphisms and its relevance). The main goal will be to...