Playlist: 11 videos

Average-Case Complexity: From Cryptography to Statistical Learning

0:59:16

On Breaking Encryption With A Statistical Zero-Knowledge Oracle

Andrej Bogdanov (The Chinese University of Hong Kong)
https://simons.berkeley.edu/talks/breaking-encryption-statistical-zero-knowledge-oracle
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
1:2:50

Average-Case Hardness Of CSPs

Benny Applebaum (Tel-Aviv University)
https://simons.berkeley.edu/talks/average-case-hardness-csps
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
1:4:0

Indistinguishability Obfuscation and Learning Problems

Aayush Jain (UCLA)
https://simons.berkeley.edu/talks/tba-147
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
0:49:40

Low-Complexity Cryptography and Simple Hard-to-Learn Functions

Yuval Ishai (Technion - Israel Institute of Technology)
https://simons.berkeley.edu/talks/low-complexity-cryptography-and-simple-hard-learn-functions
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
0:31:0

On The Hardness Of Average-Case k-SUM

Noah Stephens-Davidowitz (Cornell University)
https://simons.berkeley.edu/talks/hardness-average-case-k-sum
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
1:6:50

A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness

Guy Bresler (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/few-simple-average-case-reduction-techniques-and-their-surprising-effectiveness
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
1:2:0

Analyzing Average-Case Complexity by Meta-Complexity

Shuichi Hirahara (National Institute of Informatics, Tokyo)
https://simons.berkeley.edu/talks/analyzing-average-case-complexity-meta-complexity
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
1:1:45

Sum-Of-Squares Lower Bound for Statistical Problems

Samuel Hopkins (UC Berkeley)
https://simons.berkeley.edu/talks/sum-squares-lower-bound-statistical-problems
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
0:48:1

Computational trade-offs in graph models

Quentin Berthet (University of Cambridge)
https://simons.berkeley.edu/talks/tba-149
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page
1:0:40

Worst-Case Robustness in Machine Learning

Aditi Raghunathan (Stanford)
https://simons.berkeley.edu/talks/worst-case-robustness-machine-learning
Average-Case Complexity: From Cryptography to Statistical Learning
Visit talk page