Concentration Inequalities for Boolean Functions via Pathwise Stochastic Analysis 2

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=e-HC7xf2_HI


Duration: 1:05:19
738 views
11

Ronen Eldan (Weizmann Institute)
https://simons.berkeley.edu/events/boolean-4
Advances in Boolean Function Analysis



Other Videos By Simons Institute for the Theory of Computing


2020-08-21Crash Course on Probabilistically Checkable Proofs (PCP): Parallel Repetition
2020-08-20Remarks on the Discrete Cube
2020-08-20Crash Course on Probabilistically Checkable Proofs (PCP)...
2020-08-19Remarks on the Discrete Cube
2020-08-19Advances in Boolean Function Analysis — Pseudorandom Generators from Polarizing Random Walks - 2
2020-08-19Advances in Boolean Function Analysis — Pseudorandom Generators from Polarizing Random Walks
2020-08-19Crash Course on Probabilistically Checkable Proofs (PCP): Introduction
2020-08-12KKL via Random Restrictions
2020-08-12KKL via Random Restrictions
2020-08-07Concentration Inequalities for Boolean Functions via Pathwise Stochastic Analysis
2020-08-05Concentration Inequalities for Boolean Functions via Pathwise Stochastic Analysis 2
2020-08-04Deep “Internal” Learning - Deep Learning with Zero Examples
2020-08-04From Chaos to Information - Communication in a Crowd of Bats
2020-08-04Foundations of Early Human Learning
2020-08-04Interpreting Natural Language Processing Models
2020-08-03Sperm Whale Communication: What we know so far/ Understanding Whale Communication: First steps
2020-08-03Is Life All About Communication? A Theoretical Perspective
2020-08-03Project CETI Next Steps: Industrial-Scale Whale Bioacoustic Data Collection and Analysis
2020-08-03Improved Bounds for the Sunflower Lemma
2020-08-03What Information Do the Voices of African Savanna Elephants Communicate?
2020-07-30The Mathematical Essence of Aging | Theoretically Speaking


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Advances in Boolean Function Analysis
Ronen Eldan