Search arXivSearch

arXiv · 2608.28566

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

Abstract

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuansi Chen, Yunbum Kook. 2026-08-28. On two proofs of $d^2$ mixing of weighted Dikin walks. https://arxiv.org/abs/2608.28566

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Flow Shop Scheduling with Stochastic Reentry

We study flow shop scheduling with stochastic reentry, where jobs must complete multiple passes through the entire shop, and the number of passes that a job requires for completion is drawn from a discrete probability distribution. The goal is to find policies that minimize performance measures in expectation. Our main contribution is a reduction to a stochastic scheduling problem on identical parallel machines augmented by machine arrivals. This reduction preserves objective values and enables the transfer of structural results and performance guarantees from the auxiliary problems to the reentrant flow shop setting. We demonstrate the usefulness of this reduction by proving the optimality of simple priority policies for minimizing the makespan and the total completion time in expectation under geometric and, more generally, monotone hazard rate distributions. For minimizing the total weighted completion time, we derive an approximation guarantee for a simple priority policy that depends only on the squared coefficient of variation of the underlying distributions. Our results constitute the first optimality and approximation guarantees for flow shops with stochastic reentry and demonstrate that established scheduling policies naturally extend to this setting through the proposed reduction.

cs.DS

Diversity-Fair Online Selection

Online selection problems arise in applications such as crowdsourcing and recruitment, where decision makers may seek representation across multiple, potentially overlapping demographic or skill dimensions. We study diversity-fair online selection under adversarial arrivals. A recruiter must immediately and irrevocably decide whether to accept each candidate while selecting at most \(K\) candidates. Before arrivals begin, the recruiter observes aggregate marginal information: the total number of candidates contributing to each of the \(d\) diversity dimensions. When the candidate pool is large, this information may be estimated from demographic statistics of the applicant population. We evaluate the expected utilities across dimensions using the generalized mean \(M_p=(d^{-1}\sum_{k=1}^d U_k^p)^{1/p}, -\infty\le p\le 1,\) where \(U_k\) denotes the expected utility of dimension \(k\). We first study max-min fairness, corresponding to \(p=-\infty\). We prove that no online policy can achieve a competitive ratio better than \(O(1/\sqrt d)\) and develop a policy with a competitive ratio \(1/[4(2+\sqrt2)\sqrt d]\), establishing the optimal dependence on \(d\) up to a constant factor. Without exact marginal information, the optimal worst-case rate falls to \(Θ(1/d)\), demonstrating the value of this information. We also extend the max-min analysis to nonbinary attributes and characterize the optimal dependence on their value range. Finally, we study generalized-mean objectives. For \(0\le p\le1\), we establish an optimal competitive ratio of \(Θ(1/\log d)\). For each fixed finite negative mean \(p=-q\), where \(q>0\), our policy achieves \(d^{-q/(2q+1)}\) up to polylogarithmic factors, matching the exponent of the corresponding impossibility bound.

econ.TH