paper-with-me

홈 › Papers

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

2026-08-28 · Yuansi Chen, Yunbum Kook arxiv

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 applying it to a hybrid barrier yields an $\widetilde O(d^4)$ mixing bound for sampling from truncated PSD cones. Our second result establishes stronger $χ^2$-divergence guarantees and pointwise acceptance control using a new fourth-order bootstrap condition. For a suitably scaled Lee--Sidford metric, this yields an $\widetilde O(d^2)$ mixing bound in $χ^2$-divergence, improving on the previous $\widetilde O(d^{9/4})$ bound.

📄 PDF Abstract BibTeX arXiv:2608.28566

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Fast MCMC sampling algorithms on polytopes

2017-10-23 · Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu

We propose and analyze two new MCMC sampling algorithms, the Vaidya walk and the John walk, for generating samples from the uniform distribution over a polytope. Both random walks are sampling algorithms derived from int…

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis

2024-12-15 · Minhui Jiang, Yuansi Chen

We study the problem of drawing samples from a logconcave distribution truncated on a polytope, motivated by computational challenges in Bayesian statistical models with indicator variables, such as probit regression. Bu…

Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk

2022-06-19 · Oren Mangoubi, Nisheeth K. Vishnoi

Given a Lipschitz or smooth convex function $\, f:K \to \mathbb{R}$ for a bounded polytope $K \subseteq \mathbb{R}^d$ defined by $m$ inequalities, we consider the problem of sampling from the log-concave distribution $\p…

Bayesian Inference

Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk

2023-09-21 · NeurIPS 2023 11

Given a Lipschitz or smooth convex function $f:K \to \mathbb{R}^d$ for a bounded polytope $K:=${ $\theta \in \mathbb{R}^d: A\theta \leq b$}, where $A\in \mathbb{R}^{m\times d}$ and $b \in \mathbb{R}^m$, we consider the …

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling

2023-07-24 · Yunbum Kook, Santosh S. Vempala

The connections between (convex) optimization and (logconcave) sampling have been considerably enriched in the past decade with many conceptual and mathematical analogies. For instance, the Langevin algorithm can be view…