A Forecast Combination Framework for Hierarchical and Grouped Time Series Reconciliation
层级与分组时间序列预测协调的预测组合框架AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究时间序列预测组合、层级协调及均方误差最优预测,分类依据是预测方法而非宏观应用。
层级与分组时间序列预测协调的预测组合框架AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Forecast combining and forecast reconciliation for hierarchical and grouped time series have largely developed as separate research areas. This paper connects the two by developing a forecast combination framework for forecast reconciliation. For each bottom-level series, we construct a maximal linearly independent set of structured candidate forecasts from aggregation constraints, and show that combining these candidates and aggregating the resulting bottom-level forecasts is equivalent to standard unbiased linear reconciliation. Within this representation, we prove that mean-squared-error optimal combination weights exactly recover the widely used Minimum Trace (MinT) reconciliation. We further show that the optimal weight problem is separable across different bottom-level series, each yielding a Bates--Granger optimal forecast combination. This reveals MinT as a collection of optimal combinations over hierarchy-induced candidate forecasts. For finite-sample estimation, we propose a modular penalized framework that nests existing MinT variants and supports rich extensions including covariance shrinkage, weight penalization, and scalable series-wise separate estimation. Empirical results show that the framework is practically implementable, competitive with existing methods, and can improve accuracy while preserving coherence. Overall, the forecast combination perspective offers new interpretations of existing reconciliation approaches and provides a flexible basis for designing new methods.
协整回归变量:折叠凹惩罚何时超越 LASSO
LASSO is one of the most popular regularization methods for high-dimensional regression models. While cointegration is common in practical applications of predictive regressions with many regressors, the convex penalty of LASSO overly suppresses the coefficients of cointegrated regressors and therefore fails to deliver consistent parameter estimation. We employ folded concave penalties (FCP), including the well-known SCAD and MCP, to address this issue. Using FCP, we…
具有结构化收缩与持续性先验的贝叶斯广义网络自回归模型
We propose a Bayesian generalized network autoregressive (BGNAR) model for multivariate time series whose component series are associated with the nodes of a known network. The proposed framework combines the parsimonious network structure of the generalized network autoregressive (GNAR) model with structured shrinkage and persistence priors adapted from Bayesian vector autoregressive (BVAR) modeling. We adapt Minnesota-type shrinkage to both own-lag and network-lag…
用于非线性时间序列的贝叶斯分位数深度回声状态网络
Conditional quantiles are central to asymmetric decision losses, tail-risk assessment, and interval forecasts, but Bayesian quantile regression for nonlinear time series can be difficult when the temporal feature vector is high-dimensional. We develop the quantile deep echo state network (Q-DESN), a Bayesian quantile regression model conditional on fixed features generated by a deep echo state network. Conditional on a specified reservoir construction and feature map,…
学习宏观经济语言
We show how state-of-the-art large language models (LLMs) can be trained effectively on limited historical data for macroeconomic forecasting. We estimate a dynamic stochastic general equilibrium (DSGE) model with stochastic volatility and Student-t shocks on an initial segment of the data to obtain a posterior distribution over structural parameters. We sample from this posterior to generate millions of theory-consistent synthetic panels that, when mixed with macroeconomic…
WIRED:结构化依赖下的加权自适应多序列概率预测
This paper presents WIRED, an R package algorithm for joint probabilistic forecasting of multiple related time series. WIRED combines a library of simple marginal predictive distributions, CRPS-based adaptive mixture weights, and a Gaussian or Student t copula for cross-series simulation. We evaluate the implementation in a benchmark with four synthetic data-generating processes (DGPs), three forecast horizons, 30 replicates per DGP-horizon pair, nine ablations and external…
可扩展的 VARMA 模型估计
Vector autoregressive moving-average (VARMA) models have long been considered impractical beyond moderate dimensions: the likelihood is non-convex, the parametrization is identified only up to equivalence, and every evaluation costs a pass over the entire series. Yet their moving-average term captures with a few parameters what a pure autoregression matches only with many lags. We introduce an estimation framework that removes this computational barrier: each optimization…