Probability Theory

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
Probability-Flow ODE in Infinite-Dimensional Function Spaces
Recent advances in infinite-dimensional diffusion models have demonstrated their effectiveness and scalability in function generation …
Kunwoo Na, Junghyun Lee, Se-Young Yun, Sungbin Lim
PDF Cite
Probability-Flow ODE in Infinite-Dimensional Function Spaces
Nearly Optimal Latent State Decoding in Block MDPs
First theoretical analysis of model estimation and reward-free RL of block MDP, without resorting to function approximation frameworks. Lower bounds and algorithms with near-optimal upper bound are provided.
Yassir Jedra, Junghyun Lee, Alexandre Proutière, Se-Young Yun
PDF Cite Code Poster Slides
Nearly Optimal Latent State Decoding in Block MDPs