Videos

Start date cannot be after end date.
Learning models: connections between boosting, hard-core distributions, dense models, GAN, and regularity II Thumbnail

Learning models: connections between boosting, hard-core distributions, dense models, GAN, and regularity II

Presenter
  • Russell Impagliazzo
November 14, 2017
IAS
Learning models: connections between boosting, hard-core distributions, dense models, GAN, and regularity I Thumbnail

Learning models: connections between boosting, hard-core distributions, dense models, GAN, and regularity I

Presenter
  • Russell Impagliazzo
November 13, 2017
IAS
CSDM: A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems Thumbnail

CSDM: A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems

Presenter
  • Russell Impagliazzo
January 24, 2012
IAS
Relativized Separations of Worst-Case and Average-Case Complexities for NP Thumbnail

Relativized Separations of Worst-Case and Average-Case Complexities for NP

Presenter
  • Russell Impagliazzo
March 8, 2011
IAS
Recursively Applying Constructive Dense Model Theorems and Weak Regularity Thumbnail

Recursively Applying Constructive Dense Model Theorems and Weak Regularity

Presenter
  • Russell Impagliazzo
February 7, 2011
IAS
Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems Thumbnail

Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems

Presenter
  • Russell Impagliazzo
December 8, 2009
IAS
Workshop on Pseudorandomness in Mathematical Structures Thumbnail

Workshop on Pseudorandomness in Mathematical Structures

Presenter
  • IAS SchoolOfMath
June 14, 2010
IAS
Reproducibility in Learning Thumbnail

Reproducibility in Learning

Presenter
  • Jessica Sorrell
January 24, 2022
IAS
A Combinatorial Proof of the Chernoff-Hoeffding Bound, With Applications to Direct-Product Theorems Thumbnail

A Combinatorial Proof of the Chernoff-Hoeffding Bound, With Applications to Direct-Product Theorems

Presenter
  • Valentine Kabanets
March 30, 2010
IAS
Using Local Conductance to Give Improved Algorithms for Unique Games Thumbnail

Using Local Conductance to Give Improved Algorithms for Unique Games

Presenter
  • William Matthews
October 13, 2009
IAS
CSDM - Using Local Conductance to Give Improved Algorithms for Unique Games Thumbnail

CSDM - Using Local Conductance to Give Improved Algorithms for Unique Games

Presenter
  • William Matthews
October 13, 2009
IAS
CH, GW and the geography of tight convex hypersurfaces Thumbnail

CH, GW and the geography of tight convex hypersurfaces

Presenter
  • Russell Avdek
October 20, 2023
IAS