Skip to content
Preprint

A General Framework for Metropolis-Adjusted Dikin Walks: Dimension-Square Mixing on Polytopes and Log-Det Walks on Spectrahedra

Aug 2026 · 0 citations
Computer Science Mathematics

TL;DR

This work analyzes exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together, leaving centered fluctuations that can be controlled with second-order tools.

Abstract

We analyze exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together. Their leading uncentered terms cancel in the complete logarithmic acceptance ratio, leaving centered fluctuations that can be controlled with second-order tools. For a polytope given by $n$ inequalities and a convex $L$-Lipschitz potential, this yields warm-start mixing in $\widetilde O((d^{2}+dL^{2}R^{2})\log(w/\delta))$ steps for the regularized Lee--Sidford walk. For a spectrahedron with $n\times n$ blocks, the log-det walk mixes in $\widetilde O((\psi^\star nd+dL^{2}R^{2})\log(w/\delta))$ steps, where $\psi^\star$ measures matrix leverage. The two analyses share an acceptance-to-mixing reduction. A proposal-comparison argument transfers the polytope bound to an appropriately padded $O(1/d)$-accurate metric computed from high-precision Lewis weights. For spectrahedra, given $\widehat\psi\ge\psi^\star$, a direct-or-two-seed TensorSRHT construction gives an exact-arithmetic implementation with $\psi^\star$ replaced by $\widehat\psi$ in the mixing bound.

View source

Similar papers

#machine learning Preprint Aug 2026

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

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{\nu}$-symmetry, and mixed-trace regularity on the local metric. Th...

Yuansi Chen, Yunbum Kook · 0 citations
Preprint Aug 2026

Kac's Walk on Rotation Matrices Mixes in $\boldsymbol{\Theta(n^2)}$ Steps: A Proof Discovered with AI

Let $N=\binom n2=\dim\mathrm{SO}(n)$. We prove that the coordinate-plane Kac walk on $\mathrm{SO}(n)$ has total-variation mixing time of order $N$: for every fixed $0<\varepsilon<1$, \[ t_{\mathrm{mix}}^{(n)}(\varepsilon)=\Theta_\varepsilon(n^2). \] The lower bound is the dimensional singularity obstruction before $N$...

Tian-Le Liu · 0 citations
Preprint Aug 2026

Hit-and-Run Mixes as Fast as the Ball Walk

Let $K\subset\mathbb{R}^n$ be an isotropic convex body. We prove that the hit-and-run walk, started from any $M$-warm distribution, reaches total-variation distance $\varepsilon$ from the uniform distribution on $K$ in $O\!\left(n^2\psi_n^{-2}\log^3(M/\varepsilon)\right)$ steps, where $\psi_n^{-1}$ is the Kannan-Lov\'a...

Ruizhe Zhang · 0 citations
Preprint Sep 2026

A Walk From Free Probability to Matrix Discrepancy I: Matrix Spencer

The Matrix Spencer conjecture asks whether any $n$ real symmetric matrices A_1,...,A_n \in \mathbb{R}^{m \times m} of operator norm at most one admit a signing $x\in\{-1,1\}^n$ such that the operator norm of the signed sum is at most O(\sqrt{n \log(2m/n)}) We give a randomized algorithm establishing this bound with pol...

Tarun Kathuria · 2 citations
Preprint Sep 2026

Resolvent characteristics and quadratic mixing of Kac's walk on $SO(n)$

We study the coordinate-plane Kac walk on $\mathrm{SO}(n)$ with independent uniform rotation angles. For the unnormalized Hilbert-Schmidt Riemannian distance, we prove that the Wasserstein-$2$ Lipschitz coefficient of a block of $2\binom n2$ steps is at most $2n^{-1/200}$ for sufficiently large $n$. This gives a fixed-...

Yun-Jiang Jiang · 0 citations
Preprint Sep 2026

A global spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size

Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\,\mathrm{d} x$ on $\mathbb R^d$, where $0<m\leq L<\infty$, $mI_d\preceq\nabla^2U(x)\preceq LI_d$, and $\kappa=L/m$. It is known that, under warm-start assumptions, fixed-step Metropolis-adjusted Langevin algorithm (MALA) with properly tuned step size has mixing time of order $\ka...

Qian Qin · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.