{"title":"一种新的GARCH模型估计算法","authors":"Chenyu Gao, Ziping Zhao, D. Palomar","doi":"10.1109/SSP53291.2023.10208065","DOIUrl":null,"url":null,"abstract":"Generalized autoregressive conditional heteroskedasticity (GARCH) is a popular model to describe the time-varying conditional volatility of a time series, which is widely used in signal processing and machine learning. In this paper, we focus on the model parameter estimation of GARCH based on the Gaussian maximum likelihood estimation method. Due to the recursively coupling nature of parameters in GARCH, the optimization problem is highly non-convex. In this paper, we propose a novel algorithm based on the block majorization-minimization algorithmic framework, which can take care of the per-block variable structures for efficient problem solving. Numerical experiments demonstrate that the proposed algorithm can achieve comparable and even better performance in terms of parameter estimation errors. More importantly, estimated parameters from our algorithm always guarantee a stationary model, which is a desirable property in time series volatility modeling.","PeriodicalId":296346,"journal":{"name":"2023 IEEE Statistical Signal Processing Workshop (SSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Algorithm for GARCH Model Estimation\",\"authors\":\"Chenyu Gao, Ziping Zhao, D. Palomar\",\"doi\":\"10.1109/SSP53291.2023.10208065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generalized autoregressive conditional heteroskedasticity (GARCH) is a popular model to describe the time-varying conditional volatility of a time series, which is widely used in signal processing and machine learning. In this paper, we focus on the model parameter estimation of GARCH based on the Gaussian maximum likelihood estimation method. Due to the recursively coupling nature of parameters in GARCH, the optimization problem is highly non-convex. In this paper, we propose a novel algorithm based on the block majorization-minimization algorithmic framework, which can take care of the per-block variable structures for efficient problem solving. Numerical experiments demonstrate that the proposed algorithm can achieve comparable and even better performance in terms of parameter estimation errors. More importantly, estimated parameters from our algorithm always guarantee a stationary model, which is a desirable property in time series volatility modeling.\",\"PeriodicalId\":296346,\"journal\":{\"name\":\"2023 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP53291.2023.10208065\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP53291.2023.10208065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generalized autoregressive conditional heteroskedasticity (GARCH) is a popular model to describe the time-varying conditional volatility of a time series, which is widely used in signal processing and machine learning. In this paper, we focus on the model parameter estimation of GARCH based on the Gaussian maximum likelihood estimation method. Due to the recursively coupling nature of parameters in GARCH, the optimization problem is highly non-convex. In this paper, we propose a novel algorithm based on the block majorization-minimization algorithmic framework, which can take care of the per-block variable structures for efficient problem solving. Numerical experiments demonstrate that the proposed algorithm can achieve comparable and even better performance in terms of parameter estimation errors. More importantly, estimated parameters from our algorithm always guarantee a stationary model, which is a desirable property in time series volatility modeling.