A Unified Approach to Identifying Multivariate Time Series Models
多元时间序列模型识别的统一方法AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究多元线性时间序列、协整与不可逆结构,符合时间序列方向,但未明确涉及结构冲击分析。
多元时间序列模型识别的统一方法AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This article proposes a Bayesian procedure for simultaneous identification of the Kronecker indices and model parameters of a multivariate linear system. The model parameters include the starting values and innovations of the system so that the series considered may be co-integrated or non-invertible. The procedure uses some recent developments in stochastic search variable selection in linear regression analysis and Markov chain Monte Carlo methods in statistical computing. It also takes into consideration the row structure of a vector model implied by the Kronecker indices. Comparison with other existing methods is discussed. Simulated and real examples are used to illustrate the proposed procedure.
识别多元时间序列模型的统一方法
This article proposes a Bayesian procedure for simultaneous identification of the Kronecker indices and model parameters of a multivariate linear system. The model parameters include the starting values and innovations of the system so that the series considered may be co-integrated or non-invertible. The procedure uses some recent developments in stochastic search variable selection in linear regression analysis and Markov chain Monte Carlo methods in statistical computing.…
动态预测计量建模中的大数据
The modern economic environment is awash in Big Data. The business models of many of today’s largest and most innovative firms, for example, are intimately connected to data collection and processing. Closely related, all of science is now similarly awash in Big Data, due to massive advances in data capture and storage technology, typically in conjunction with the internet.1 Time-series econometrics is no exception, and the time-series community is beginning to confront Big…
平稳与非平稳自回归中自适应 Lasso 的一致及保守模型选择
We show that the adaptive Lasso is oracle efficient in stationary and nonstationary autoregressions. This means that it estimates parameters consistently, selects the correct sparsity pattern, and estimates the coefficients belonging to the relevant variables at the same asymptotic efficiency as if only these had been included in the model from the outset. In particular, this implies that it is able to discriminate between stationary and nonstationary autoregressions and it…
紧识别SVAR中基于“软”符号限制的快速后验抽样
We propose algorithms for conducting Bayesian inference in structural vector autoregressions identified using sign restrictions. The key feature of our approach is a sampling step based on ‘soft’ sign restrictions. This step draws from a target density that smoothly penalises parameter values that violate the restrictions, facilitating the use of computationally efficient Markov chain Monte Carlo sampling algorithms. An importance-sampling step yields draws conditional on…
用于因果推断与模型发现的连续时间集合 Kalman–Bucy 平滑器
Data assimilation (DA) integrates observational information with model predictions to improve state estimation in complex systems. While filtering provides the basis for online forecasts by using only past and present observations, it can exhibit delays and biases when the underlying dynamics evolve rapidly or undergo regime transitions. Smoothing, which additionally incorporates future observations, provides a natural pipeline for hindcasting and reanalysis that yields an…
可扩展的 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…