paper-with-me

홈 › Papers

On the $α$-lazy version of Markov chains in estimation and testing problems

2021-05-20 · Sela Fried, Geoffrey Wolfer

Given access to a single long trajectory generated by an unknown irreducible Markov chain $M$, we simulate an $\alpha$-lazy version of $M$ which is ergodic. This enables us to generalize recent results on estimation and identity testing that were stated for ergodic Markov chains in a way that allows fully empirical inference. In particular, our approach shows that the pseudo spectral gap introduced by Paulin [2015] and defined for ergodic Markov chains may be given a meaning already in the case of irreducible but possibly periodic Markov chains.

📄 PDF Abstract BibTeX arXiv:2105.09536

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Testing Symmetric Markov Chains from a Single Trajectory

2017-04-22 · Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin

Classical distribution testing assumes access to i.i.d. samples from the distribution that is being tested. We initiate the study of Markov chain testing, assuming access to a single trajectory of a Markov Chain. In part…

Testing Markov Chains without Hitting

2019-02-06 · Yeshwanth Cherapanamjeri, Peter L. Bartlett

We study the problem of identity testing of markov chains. In this setting, we are given access to a single trajectory from a markov chain with unknown transition matrix $Q$ and the goal is to determine whether $Q = P$ f…

Identity testing of reversible Markov chains

2021-05-13 · Sela Fried, Geoffrey Wolfer

We consider the problem of identity testing of Markov chain transition matrices based on a single trajectory of observations under the distance notion introduced by Daskalakis et al. [2018a] and further analyzed by Chera…

A Geometric Reduction Approach for Identity Testing of Reversible Markov Chains

2023-02-16 · Geoffrey Wolfer, Shun Watanabe

We consider the problem of testing the identity of a reversible Markov chain against a reference from a single trajectory of observations. Employing the recently introduced notion of a lumping-congruent Markov embedding,…

Maximum likelihood trajectories for continuous-time Markov chains

2009-12-01 · NeurIPS 2009 12 · Theodore J. Perkins

Continuous-time Markov chains are used to model systems in which transitions between states as well as the time the system spends in each state are random. Many computational problems related to such chains have been so…

parameter estimation