Playlist: 25 videos

Real Analysis in Testing, Learning and Inapproximability

Aug. 26 – Aug. 30, 2013

The goal of the first workshop of the program is to identify challenges from learning, computational complexity, hardness of approximation and communication complexity that can be explicitly expressed in discrete analytic...

0:54:52

Local Combinatorics, Or: What To Do With All Those Gigantic Graphs?

Nati Linial, Hebrew University of Jerusalem
Real Analysis in Testing, Learning and Inapproximability
http://simons.berkeley.edu/talks/nati-linial-2013-08-29
Visit talk page
0:31:12

Agnostic Learning Over Permutation Invariant Distributions

Karl Wimmer, Duquesne University
Real Analysis in Testing, Learning and Inapproximability
http://simons.berkeley.edu/talks/karl-wimmer-2013-08-29
Visit talk page
0:52:43

Association Schemes, Non-Commutative Polynomials and Lasserre Lower Bounds for Planted Clique

Raghu Meka, Microsoft Research
Real Analysis in Testing, Learning and Inapproximability
http://simons.berkeley.edu/talks/raghu-meka-2013-08-30
Visit talk page
0:43:51

Fourier PCA

Ying Xiao, Georgia Institute of Technology
Real Analysis in Testing, Learning and Inapproximability
http://simons.berkeley.edu/talks/ying-xiao-2013-08-30
Visit talk page
0:25:16

MCMC Learning

Varun Kanade, UC Berkeley
Real Analysis in Testing, Learning and Inapproximability
http://simons.berkeley.edu/talks/varun-kanade-2013-08-30
Visit talk page