On the Estimation of Linear Softmax Parametrized Markov Chains

Jun 26, 2024·
Kunwoo Na
Junghyun Lee
Junghyun Lee
,
Se-Young Yun
· 0 min read
Abstract
In reinforcement learning and deep learning, softmax parameterization is commonly used to represent discrete probability distributions.In this work, we study three possible softmax parametrizations of the transition matrix of the Markov chain. Through theoretical and empirical lenses, we provide several insights into the effect of such parametrizations on estimating the Markov transition matrix.
Type
Publication
Korea Computer Congress
publications
Junghyun Lee
Authors
PhD Candidate in Artificial Intelligence
PhD candidate at KAIST AI, jointly advised by Se-Young Yun and Chulhee Yun. I work on interactive machine learning, theoretical aspects of LLMs, learning/optimization theory, and statistical analysis of large networks.