{"title":"A Bayesian Dirichlet auto-regressive moving average model for forecasting lead times","authors":"","doi":"10.1016/j.ijforecast.2024.01.004","DOIUrl":"10.1016/j.ijforecast.2024.01.004","url":null,"abstract":"<div><p>In the hospitality industry, lead time data are a form of compositional data that are crucial for business planning, resource allocation, and staffing. Hospitality businesses accrue fees daily, but recognition of these fees is often deferred. This paper presents a novel class of Bayesian time series models, the Bayesian Dirichlet auto-regressive moving average (B-DARMA) model, designed specifically for compositional time series. The model is motivated by the analysis of five years of daily fees data from Airbnb, with the aim of forecasting the proportion of future fees that will be recognized in 12 consecutive monthly intervals. Each day’s compositional data are modeled as Dirichlet distributed, given the mean and a scale parameter. The mean is modeled using a vector auto-regressive moving average process, which depends on previous compositional data, previous compositional parameters, and daily covariates. The B-DARMA model provides a robust solution for analyzing large compositional vectors and time series of varying lengths. It offers efficiency gains through the choice of priors, yields interpretable parameters for inference, and produces reasonable forecasts. The paper also explores the use of normal and horseshoe priors for the vector auto-regressive and vector moving average coefficients, and for regression coefficients. The efficacy of the B-DARMA model is demonstrated through simulation studies and an analysis of Airbnb data.</p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1556-1567"},"PeriodicalIF":6.9,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0169207024000049/pdfft?md5=8f990fc55b20d6580d627b9419dc4176&pid=1-s2.0-S0169207024000049-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139918147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Forecasting UK inflation bottom up","authors":"","doi":"10.1016/j.ijforecast.2024.01.001","DOIUrl":"10.1016/j.ijforecast.2024.01.001","url":null,"abstract":"<div><p>We forecast CPI<span><span> inflation<span><span> indicators in the United Kingdom using a large set of monthly disaggregated CPI item series covering a sample period of twenty years, and employing a range of forecasting tools to deal with the high dimension of the set of predictors. Although an autoregressive model proofs hard to outperform overall, Ridge regression combined with CPI item series performs strongly in forecasting headline </span>inflation. A range of shrinkage methods yields significant improvement over sub-periods where inflation was rising, falling or in the </span></span>tails<span> of its distribution. Once CPI item series are exploited, we find little additional forecast gain from including macroeconomic<span> predictors. The forecast performance of non-parametric machine learning methods is relatively weak. Using Shapley values to decompose forecast signals exploited by a Random Forest, we show that the ability of non-parametric tools to flexibly switch between signals from groups of indicators may come at the cost of high variance and, as such, hurt forecast performance.</span></span></span></p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1521-1538"},"PeriodicalIF":6.9,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139890139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Network log-ARCH models for forecasting stock market volatility","authors":"","doi":"10.1016/j.ijforecast.2024.01.002","DOIUrl":"10.1016/j.ijforecast.2024.01.002","url":null,"abstract":"<div><p>This paper presents a dynamic network autoregressive conditional heteroscedasticity (ARCH) model suitable for high-dimensional cases where multivariate ARCH models are typically no longer applicable. We adopt the theoretical foundations from spatiotemporal statistics and transfer the dynamic ARCH model processes to networks. The model integrates temporally lagged volatility and information from adjacent nodes, which may instantaneously spill across the entire network. The model is used to forecast volatility in the US stock market, and the edges are determined based on various distance and correlation measures between the time series. The performance of alternative network definitions is compared with independent univariate log-ARCH models in terms of out-of-sample prediction accuracy. The results indicate that more accurate forecasts are obtained with network-based models and that accuracy can be improved by combining the forecasts of different network definitions. We emphasise the significance for practitioners to integrate network structure information when developing volatility forecasts.</p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1539-1555"},"PeriodicalIF":6.9,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0169207024000025/pdfft?md5=784080169573790027c8d4ca4cbd201c&pid=1-s2.0-S0169207024000025-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139588033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Instance-based meta-learning for conditionally dependent univariate multi-step forecasting","authors":"","doi":"10.1016/j.ijforecast.2023.12.010","DOIUrl":"10.1016/j.ijforecast.2023.12.010","url":null,"abstract":"<div><p><span>Multi-step prediction is a key challenge in univariate forecasting. However, forecasting accuracy<span> decreases as predictions are made further into the future. This is caused by the decreasing predictability and the error propagation along the horizon. In this paper, we propose a novel method called </span></span><span>Forecasted Trajectory Neighbors</span> (<span>FTN</span><span>) for multi-step forecasting with univariate time series. </span><span>FTN</span><span> is a meta-learning strategy that can be integrated with any state-of-the-art multi-step forecasting approach. It works by using training observations to correct the errors made during multiple predictions. This is accomplished by retrieving the nearest neighbors of the multi-step forecasts and averaging these for prediction. The motivation is to introduce, in a lightweight manner, a conditional dependent constraint across the forecasting horizons. Such a constraint, not always taken into account by most strategies, can be considered as a sort of regularization<span> element. We carried out extensive experiments using 7795 time series from different application domains. We found that our method improves the performance of several state-of-the-art multi-step forecasting methods. An implementation of the proposed method is publicly available online, and the experiments are reproducible.</span></span></p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1507-1520"},"PeriodicalIF":6.9,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139587447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Survey density forecast comparison in small samples","authors":"","doi":"10.1016/j.ijforecast.2023.12.007","DOIUrl":"10.1016/j.ijforecast.2023.12.007","url":null,"abstract":"<div><p>We apply fixed-<span><math><mi>b</mi></math></span> and fixed-<span><math><mi>m</mi></math></span> asymptotics to tests of equal predictive accuracy and of encompassing for survey density forecasts. We verify in an original Monte Carlo design that fixed-smoothing asymptotics delivers correctly sized tests in this framework, even when only a small number of out of sample observations is available. We use the proposed density forecast comparison tests with fixed-smoothing asymptotics to assess the predictive ability of density forecasts from the European Central Bank’s Survey of Professional Forecasters (ECB SPF). We find an improvement in the relative predictive ability of the ECB SPF since 2010, suggesting a change in the forecasting practice after the financial crisis.</p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1486-1504"},"PeriodicalIF":6.9,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139587455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pavel Atanasov , Jens Witkowski , Barbara Mellers , Philip Tetlock
{"title":"Crowd prediction systems: Markets, polls, and elite forecasters","authors":"Pavel Atanasov , Jens Witkowski , Barbara Mellers , Philip Tetlock","doi":"10.1016/j.ijforecast.2023.12.009","DOIUrl":"10.1016/j.ijforecast.2023.12.009","url":null,"abstract":"<div><div>What systems should we use to elicit and aggregate judgmental forecasts? Who should be asked to make such forecasts? We address these questions by assessing two widely used crowd prediction systems: prediction markets and prediction polls. Our main test compares a prediction market against team-based prediction polls, using data from a large, multi-year forecasting competition. Each of these two systems uses inputs from either a large, sub-elite or a small, elite crowd. We find that small, elite crowds outperform larger ones, whereas the two systems are statistically tied. In addition to this main research question, we examine two complementary questions. First, we compare two market structures—continuous double auction (CDA) markets and logarithmic market scoring rule (LMSR) markets—and find that the LMSR market produces more accurate forecasts than the CDA market, especially on low-activity questions. Second, given the importance of elite forecasters, we compare the talent-spotting properties of the two systems and find that markets and polls are equally effective at identifying elite forecasters. Overall, the performance benefits of “superforecasting” hold across systems. Managers should move towards identifying and deploying small, select crowds to maximize forecasting performance.</div></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"41 2","pages":"Pages 580-595"},"PeriodicalIF":6.9,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139587673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CRPS-based online learning for nonlinear probabilistic forecast combination","authors":"","doi":"10.1016/j.ijforecast.2023.12.005","DOIUrl":"10.1016/j.ijforecast.2023.12.005","url":null,"abstract":"<div><p>Forecast combination improves upon the component forecasts. Most often, combination approaches are restricted to the linear setting only. However, theory shows that if the component forecasts are neutrally dispersed—a requirement for probabilistic calibration—linear forecast combination will only increase dispersion and thus lead to miscalibration. Furthermore, the accuracy of the component forecasts may vary over time and the combination weights should vary accordingly, necessitating updates as time progresses. In this paper, we develop an online version of the beta-transformed linear pool, which theoretically can transform the probabilistic forecasts such that they are neutrally dispersed. We show that, in the case of stationary synthetic time series, the performance of the developed method converges to that of the optimal combination in hindsight. Moreover, in the case of nonstationary real-world time series from a wind farm in mid-west France, the developed model outperforms the optimal combination in hindsight.</p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1449-1466"},"PeriodicalIF":6.9,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139516222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Forecasting seasonal demand for retail: A Fourier time-varying grey model","authors":"","doi":"10.1016/j.ijforecast.2023.12.006","DOIUrl":"10.1016/j.ijforecast.2023.12.006","url":null,"abstract":"<div><p><span>Seasonal demand forecasting is critical for effective supply chain management. However, conventional forecasting methods </span>face difficulties accurately estimating seasonal variations, owing to time-varying demand trends and limited data availability. In this paper, we propose a Fourier time-varying grey model (FTGM) to tackle this issue. The FTGM builds upon grey models, which are effective with limited data, and leverages Fourier functions to approximate time-varying parameters that allow it to represent seasonal variations. A data-driven selection algorithm adaptively determines the appropriate Fourier order of the FTGM without prior knowledge of data characteristics. Using the well-known M5 competition data, we compare our model with state-of-the-art forecasting methods taken from grey models, statistical methods, and architectures of neural network-based methods. The experimental results show that the FTGM outperforms popular seasonal forecasting methods in terms of standard accuracy metrics, providing a competitive alternative for seasonal demand forecasting in retail companies.</p></div>","PeriodicalId":14061,"journal":{"name":"International Journal of Forecasting","volume":"40 4","pages":"Pages 1467-1485"},"PeriodicalIF":6.9,"publicationDate":"2024-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139516015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}