0/16 уроков (0%)
– из 16
Strong Self-Concordance and Sampling
YouTube·Theoretical Computer Science
Explore an algorithm for sampling a polytope that mixes in Õ(n^2) steps from a warm start using strong self-concordance in this 25-minute ACM conference talk. Discover the connection between strong self-concordance of well-known barrier functions and the KLS isoperimetry conjecture. Learn about sampling techniques, including the Ball Walk and Generalized Dikin Walk, and delve into main results, conductance bounding, and proof outlines. Examine the Lee Sidford Barrier and its properties, and consider open problems in the field.