An efficient algorithm for computation of information matrix in phase-type fitting

Jiahao Zhang, Junjun Zheng, H. Okamura, T. Dohi
{"title":"An efficient algorithm for computation of information matrix in phase-type fitting","authors":"Jiahao Zhang, Junjun Zheng, H. Okamura, T. Dohi","doi":"10.1080/15502287.2021.1916198","DOIUrl":null,"url":null,"abstract":"Abstract Phase-type (PH) fitting is a technique to approximate any general distribution as a PH distribution, which is a probability distribution representing an absorbing time of a Markov chain. Since the PH distribution is described as a discrete- or continuous-time Markov chain (CTMC), the PH fitting can provide approximate Markov models to any non-exponential stochastic models. Thus, the PH fitting is helpful for model-based performance evaluation. On the other hand, from the statistical point of view, the PH fitting is categorized as parameter estimation from data. Some efficient PH fitting techniques are based on the maximum-likelihood principle. Therefore, it is crucial to evaluate statistical errors, i.e., the variance and covariance of estimators. In maximum-likelihood estimation, the Fisher information matrix is a well-known method to compute the variance and covariance of estimators, and is obtained as the second derivative of the log-likelihood function (LLF). In this article, we propose an algorithm for efficiently computing the Fisher information matrix in PH fitting. By applying the uniformization technique to a CTMC, we design the algorithm for computing the second derivatives of LLF in PH fitting.","PeriodicalId":315058,"journal":{"name":"International Journal for Computational Methods in Engineering Science and Mechanics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal for Computational Methods in Engineering Science and Mechanics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/15502287.2021.1916198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract Phase-type (PH) fitting is a technique to approximate any general distribution as a PH distribution, which is a probability distribution representing an absorbing time of a Markov chain. Since the PH distribution is described as a discrete- or continuous-time Markov chain (CTMC), the PH fitting can provide approximate Markov models to any non-exponential stochastic models. Thus, the PH fitting is helpful for model-based performance evaluation. On the other hand, from the statistical point of view, the PH fitting is categorized as parameter estimation from data. Some efficient PH fitting techniques are based on the maximum-likelihood principle. Therefore, it is crucial to evaluate statistical errors, i.e., the variance and covariance of estimators. In maximum-likelihood estimation, the Fisher information matrix is a well-known method to compute the variance and covariance of estimators, and is obtained as the second derivative of the log-likelihood function (LLF). In this article, we propose an algorithm for efficiently computing the Fisher information matrix in PH fitting. By applying the uniformization technique to a CTMC, we design the algorithm for computing the second derivatives of LLF in PH fitting.
相位型拟合中信息矩阵计算的一种有效算法
相型拟合是一种将任何一般分布近似为PH分布的技术,PH分布是表示马尔可夫链吸收时间的概率分布。由于PH分布被描述为离散时间或连续时间马尔可夫链(CTMC),因此PH拟合可以为任何非指数随机模型提供近似马尔可夫模型。因此,PH拟合有助于基于模型的性能评估。另一方面,从统计学的角度来看,PH拟合属于数据参数估计。一些有效的PH拟合技术是基于最大似然原理的。因此,评估统计误差,即估计量的方差和协方差是至关重要的。在最大似然估计中,Fisher信息矩阵是一种众所周知的计算估计量方差和协方差的方法,它是对数似然函数(LLF)的二阶导数。本文提出了一种在PH拟合中有效计算Fisher信息矩阵的算法。通过将均匀化技术应用于CTMC,设计了PH拟合中LLF二阶导数的计算算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信