Past Events
May
06
PACM Colloquium
Yuxin Chen, Princeton University
Bridging convex and nonconvex optimization in noisy matrix completion: Stability and uncertainty quantification
Apr
29
PACM Colloquium
Oded Regev, Courant Institute of Mathematical Sciences, New York University
Lattice-Based Cryptography and the Learning with Errors Problem
Apr
15
PACM Colloquium
Subhash Khot, Courant Institute of Mathematical Sciences-New York University
Hardness of Approximation
Apr
08
PACM Colloquium
Avi Wigderson, IAS
Optimization, Complexity and Math (through the lens of one problem and one algorithm)
Apr
01
PACM Colloquium
Ronitt Rubinfeld, MIT and Tel Aviv University
Local algorithms for sparse connected subgraphs
Mar
25
PACM Colloquium
Imre Bárány,Renyi Institute, Budapest and University College, London
Theorems of Caratheodory, Helly, and Tverberg without dimension
Mar
11
PACM Colloquium
Eric Vanden-Eijnden, Courant Institute, New York University
Trainability and accuracy of neural networks used in machine learning
Mar
04
PACM Colloquium
Shay Moran, Princeton University
The Optimal Approximation Factor in Density Estimation
Feb
25
PACM Colloquium
Alex Townsend, Cornell University
Why are so many matrices and tensors low-rank in computational mathematics?
Feb
18
PACM Colloquium
Jörn Dunkel, MIT
Symmetry breaking and pattern formation in soft matter and active fluids
Feb
11
PACM Colloquium
Leslie Greengard, Courant Institute of Mathematical Sciences, New York University
Adaptive methods for the simulation of diffusion and fluid flow in complex geometries
Feb
04
Dec
10
Dec
03
PACM Colloquium
Carlile Lavor, University of Campinas
Distance Geometry and Geometric Algebra for Protein Structure Determination
Nov
26
PACM Colloquium
Pierre-Thomas Brun, Princeton University
Architecting soft functional materials with instabilities
Nov
19
PACM Colloquium
Miranda Homes-Cerfon, Courant Institute of Mathematical Sciences, New York University
Kinetics of particles with short-range interactions
Nov
12
Nov
07
PACM Colloquium
Kristin Lauter, Microsoft Research
How to Keep your Secrets in a Post-Quantum World (or: Supersingular Isogeny Graphs in Cryptography)
Nov
05
Oct
22
PACM Colloquium
Matthew Salganik, Princeton University
The Fragile Families Challenge: A Scientific Mass Collaboration
Oct
15
PACM Colloquium
Alexander Vladimirsky, Cornell University
Agreeing to Disagree in Anisotropic Crowds
Oct
08
PACM Colloquium
Nicolas Boumal, Princeton University
Handling non-convexity in low-rank approaches for semidefinite programming
Oct
01
PACM Colloquium
Mykhaylo Shkolnikov, Princeton University
Particles interacting through their hitting times: neuron firing, supercooling and systemic risk
Sep
24
Sep
17