SOURCE-LINKED INTELLIGENCE

On two proofs of $d^2$ mixing of weighted Dikin walks

arXiv · AI, language, vision and robotics · article · Aug 28, 2026 · UTC

We study the mixing time of weighted Dikin walks for sampling from exponential distributions on polytopes and truncated positive-semidefinite (PSD) cones. Our first result gives a general total-variation mixing bound under strong self-concordance, $\barν$-symmetry, and mixed-trace regularity on the local metric. The key idea is to control the Metropolis--Hastings acceptance probability on a high-probability region rather than at every point. Applying this framework to the Lee--Sidford, Lewis-weight, and John metrics yields an $\widetilde O(d^2)$ mixing bound for sampling from polytopes, while

Read original source ↗ Open in workspace

recordType

paper

region

Global