Videos

Start date cannot be after end date.
Is non-convex optimization really hard? A couple of recent stories Thumbnail

Is non-convex optimization really hard? A couple of recent stories

Presenter
  • Emmanuel Candès
September 26, 2018
IPAM
Deep Learning and Modeling: Taking the Best out of Both Worlds Thumbnail

Deep Learning and Modeling: Taking the Best out of Both Worlds

Presenter
  • Gitta Kutyniok
January 28, 2020
IPAM
Applied Harmonic Analysis meets Compressed Sensing Thumbnail

Applied Harmonic Analysis meets Compressed Sensing

Presenter
  • Gitta Kutyniok
February 26, 2015
IPAM
Intractability in Algorithmic Game Theory Thumbnail

Intractability in Algorithmic Game Theory

Presenter
  • Tim Roughgarden
March 11, 2013
IAS
A Theory of Cryptographic Complexity Thumbnail

A Theory of Cryptographic Complexity

Presenter
  • Manoj M.
March 1, 2010
IAS

From Dynamics to Algorithms for Optimization and Sampling

Presenter
  • Andre Wibisono
June 24, 2024
ICERM

Discrete statistics of permutations and their generalizations

Presenter
  • Pamela E. Harris
June 26, 2024
ICERM