arXiv Statistics ML By Zhao Song, Lichen Zhang

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

Read the original on arXiv Statistics ML →

arXiv:2608. 25273v1 Announce Type: cross Abstract: We analyze exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together.

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 Statistics ML.

arXiv Machine Learning
Aug 31

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

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.

By Yuansi Chen, Yunbum Kook
arXiv Machine Learning
Jun 19

Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model

arXiv:2606. 20082v1 Announce Type: cross Abstract: The John ellipsoid of a symmetric polytope $P=\{\mathbf{x}\in\mathbb{R}^d:\|\mathbf{A}\mathbf{x}\|_\infty\le1\}$, $\mathbf{A}\in\mathbb{R}^{n\times d}$, is computed by a long line of leverage-score algorithms, from Cohen, Cousins, Lee and Yang (COLT 2019) to its successors [WY24, CLS+25], all reaching a $(1+\varepsilon)$-approximation in $\Theta(\varepsilon^{-1}\log(n/d))$ iterations.

By Xiaoyu Li, Junwei Yu, Jiaojiao Jiang, Junbin Gao, Andi Han
arXiv Machine Learning
Aug 10

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.

By Ibne Farabi Shihab, Joyanta Jyoti Mondal
arXiv Machine Learning
Sep 10

Smoothed Picard Hamiltonian Monte Carlo

arXiv:2609.06906v1 Announce Type: cross Abstract: We develop a new low-accuracy sampler, called \emph{smoothed Picard Hamiltonian Monte Carlo}, which combines Gaussian smoothing, Picard iteration, an...

By Fan Chen, Sinho Chewi, Jianfeng Lu, Matthew S Zhang