~/talk

Stochastic Control via Entropy Compression

Talkat Uncertainty in Computation 2016 · 2016-10-04..10-07· [machine-learning]
links:none on file
slides:none on file

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

  1. 0:00Introduction to stochastic
  2. 1:03The Lovasz local lemma
  3. 4:24Satisfiability applications
  4. 6:06Moser's algorithm
  5. 8:33Flows and actions framework
  6. 12:33Entropy and congestion
  7. 17:34Amenability and causality
  8. 21:33Convergence theorem
  9. 25:31Noise and robust control
  10. 32:24Entropy compression theory
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.