Stochastic Control via Entropy Compression
summary
Introduces a flows-action framework that turns Moser’s local-resampling into a general stochastic-control algorithm, proves a cutoff-style convergence when every flaw satisfies amenability = local entropy − congestion (amenability k in k-CNF so 2−k appears), and handles adversarial noise by a noise model with adversary probability p whose extra burden is a weighted sum of 2−amenability terms. Gives a concrete criterion to compute tolerance (recovers near-LLL bounds, linear-time finding under those conditions) and uses entropy compression for sequences to bound failure probability.
AI-written summary · about
chapters (10)
- 0:00Introduction to stochastic
- 1:03The Lovasz local lemma
- 4:24Satisfiability applications
- 6:06Moser's algorithm
- 8:33Flows and actions framework
- 12:33Entropy and congestion
- 17:34Amenability and causality
- 21:33Convergence theorem
- 25:31Noise and robust control
- 32:24Entropy compression theory
related talks
59mCompositional Properties of Statistical Procedures: An Information-Theoretic View
38mAn Information Theoretic View of Hypercontractivity
29mA Pre-Expectation Calculus for Probabilistic Sensitivity
01h 01mRobustness, Stochastics, Uncertainty 1
33mA Few Connections Between Optimization and Probability
01h 03mSampling Crash Course
34mThe Non-Stochastic Control Framework
28mData Driven Convergence in Statistical Estimators
