- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Adaptive penalized likelihood method for Markov chain...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Adaptive penalized likelihood method for Markov chain and its oracle properties Zhou, Yining
Abstract
The maximum likelihood estimation (MLE) and Likelihood Ratio Test (LRT) are widely used methods for estimating the transition probability matrix in Markov chains and identifying significant relationships between transitions, such as equality. However, the estimated transition probability matrix derived from MLE lacks accuracy compared to the real one, and LRT is inefficient in high-dimensional Markov chains. In this study, we extended the adaptive Lasso technique from linear models to Markov chains and proposed a novel model by applying penalized maximum likelihood estimation to optimize the estimation of the transition probability matrix. We name this novel methodology McALasso. Additionally, we demonstrated that McALasso enjoys oracle properties, meaning the estimated transition probability matrix performs as well as the true one when given. Simulations show that our new method performs very well overall in comparison with various competitors. Real data analysis further convinces us of the value of our proposed method.
Item Metadata
Title |
Adaptive penalized likelihood method for Markov chain and its oracle properties
|
Creator | |
Supervisor | |
Publisher |
University of British Columbia
|
Date Issued |
2024
|
Description |
The maximum likelihood estimation (MLE) and Likelihood Ratio Test (LRT) are widely used methods for estimating the transition probability matrix in Markov chains and identifying significant relationships between transitions, such as equality. However, the estimated transition probability matrix derived from MLE lacks accuracy compared to the real one, and LRT is inefficient in high-dimensional Markov chains. In this study, we extended the adaptive Lasso technique from linear models to Markov chains and proposed a novel model by applying penalized maximum likelihood estimation to optimize the estimation of the transition probability matrix. We name this novel methodology McALasso. Additionally, we demonstrated that McALasso enjoys oracle properties, meaning the estimated transition probability matrix performs as well as the true one when given. Simulations show that our new method performs very well overall in comparison with various competitors. Real data analysis further convinces us of the value of our proposed method.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2024-09-16
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0445402
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2024-11
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International