Clustering

Near-Optimal Clustering in Mixture of Markov Chains
We study the problem of clustering T trajectories of length H, each generated by one of K unknown ergodic Markov chains over a finite …
Junghyun Lee, Yassir Jedra, Alexandre Proutière, Se-Young Yun
PDF Cite
Near-Optimal Clustering in Mixture of Markov Chains
Statistical Learning in Structured Markov Chains and MDPs
Project #1. Clustered State Space Nearly Optimal Latent State Decoding in Block MDPs Accepted to AISTATS 2023 Joint work with Se-Young Yun (KAIST AI) and Yassir Jedra, Alexandre Proutière (KTH EECS).
Junghyun Lee