This is the authors' abstract. We don't add key points for this paper.
We consider whether ergodic Markov chains with bounded step size remain bounded in probability when their transitions are modified by an adversary on a bounded subset. We provide counterexamples to show that the answer is no in general, and prove theorems to show that the answer is yes under various additional assumptions. We then use our results to prove convergence of various adaptive Markov chain Monte Carlo algorithms.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
A 2015 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: