arXiv Machine Learning By Yuansi Chen, Yunbum Kook

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

Read the original on arXiv Machine Learning →

The paper investigates the mixing time of weighted Dikin walks used for sampling from exponential distributions on polytopes and truncated positive-semidefinite cones. It presents a general total-variation mixing bound under conditions of strong self-concordance, ν-symmetry, and mixed-trace regularity, achieving an “~O(d^2)" bound for polytopes and “~O(d^4)" for truncated PSD cones. A second result introduces a fourth-order bootstrap condition that yields stronger χ^2-divergence guarantees and an improved “~O(d^2)" mixing bound for a scaled Lee–Sidford metric.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 25

Structured Approximations of Measures

arXiv:2310. 09149v3 Announce Type: replace-cross Abstract: We study the approximation of probability measures in the Wasserstein-$p$ distance by structured classes of approximators, motivated by applications in imaging, machine learning, and physical measurement under sensor constraints.

By Keaton Hamm, Varun Khurana