资源分类
》 资源 》论文》On Mixtures of Markov Chains

On Mixtures of Markov Chains

2020-02-05 | |  71 |   42 |   0

Abstract

 We study the problem of reconstructing a mixture of Markov chains from the trajectories generated by random walks through the state space. Under mild nondegeneracy conditions, we show that we can uniquely reconstruct the underlying chains by only considering trajectories of length three, which represent triples of states. Our algorithm is spectral in nature, and is easy to implement.

上一篇：Examples are not Enough, Learn to Criticize! Criticism for Interpretability

下一篇：Learning HMMs with Nonparametric Emissions via Spectral Decompositions of Continuous Matrices

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...