Unit Root Tests in ARMA Models with Data-Dependent Methods for the Selection of the Truncation Lag
ARMA 模型单位根检验中的数据驱动截断滞后选择AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确研究 ARMA 模型的单位根检验与滞后选择,直接属于时间序列。
ARMA 模型单位根检验中的数据驱动截断滞后选择AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We analyze the choice of the truncation lag in the context of the Said-Dickey test for the presence of a unit root in a general autoregressive moving average model. It is shown that a deterministic relationship between the truncation lag and the sample size is dominated by data-dependent rules that take sample information into account. In particular, we study data-dependent rules that are not constrained to satisfy the lower bound condition imposed by Said-Dickey. Akaike's information criterion falls into this category. The analytical properties of the truncation lag selected according to a class of information criteria are compared to those based on sequential testing for the significance of coefficients on additional lags. The asymptotic properties of the unit root test under various methods for selecting the truncation lag are analyzed, and simulations are used to show their distinctive behavior in finite samples. Our results favor methods based on sequential tests over those based on information criteria, because the former show less size distortions and have comparable power.
自适应 Lasso 解路径单位根检验的自助法改进
We propose sieve wild bootstrap analogues to the adaptive Lasso solution path unit root tests of Arnold and Reinschlüssel (2024) arXiv:2404.06205 to improve finite sample properties and extend their applicability to a generalised framework, allowing for non-stationary volatility. Numerical evidence shows the bootstrap to improve the tests' precision for error processes that promote spurious rejections of the unit root null, depending on the detrending procedure. The…
We show that the activation knot of a potentially non-stationary regressor on the adaptive Lasso solution path in autoregressions can be leveraged for selection-free inference about a unit root. The resulting test has asymptotic power against local alternatives in $1/T$ neighbourhoods, unlike post-selection inference methods based on consistent model selection. Exploiting the information enrichment principle devised by Reinschlüssel and Arnold (arXiv:2402.16580 [stat.ME]) to…
协整回归变量:折叠凹惩罚何时超越 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…
有意过度识别的局部投影
Local projections (LPs) have become a standard tool for estimating dynamic effects in macroeconomics and are typically implemented using ordinary least squares (OLS) for a given lag order. We propose an alternative approach that exploits additional lags as excluded instrumental variables (IVs). Under a finite-order model with martingale-difference shocks, the resulting (optimally weighted) IV estimator is never asymptotically less efficient than OLS and, as we show, can…
带移民的单位根Galton–Watson过程的漂移推断
We study inference on the drift of a critical Galton--Watson process with immigration, a count time series with a unit root. Climate change motivates such nonstationary models for weather-related disaster counts. The drift is the expected increase in the count per period. Ordinary least squares is inconsistent for the drift, so we study state-weighted least squares, giving greater weight to observations following small counts, where conditional variance is lower. Under…
基于时延嵌入置信界的拓扑周期性检验
Time-delay embedding is a fundamental technique in Topological Data Analysis (TDA) for reconstructing phase-space dynamics of time-series data, where persistent homology can reveal loops associated with periodicity. However, rigorous statistical uncertainty quantification for these features remains underdeveloped. First, we analyze the topology of time-delay embeddings, showing that the embedded trajectory is homotopy equivalent to a circle ($S^1$) for periodic signals and…