arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.08771math.STstat.TH
收藏

高维重尾时间序列的最优稀疏估计

Optimal Sparse Estimation of High Dimensional Heavy-tailed Time Series

Sagnik Halder, George Michailidis

摘要:

近年来,高维向量自回归模型(VAR)由于在健康、工程和社会科学领域的新应用而引起了人们的广泛兴趣。时间相关性的存在对惩罚估计技术理论提出了额外的挑战,惩罚估计技术广泛用于分析iid对应物。然而,最近的工作(例如,[Basu和Michaillem,2015年,Kock和Callot,2015年])已经建立了应用于涉及高维稳定高斯过程的模型的$\ell_1$ -LASSO正则化估计的最佳一致性。时间相关性的唯一代价是一个额外的乘法因子,对于独立同分布(iid)数据,它等于1。此外,[Wong等人,2020]将这些结果扩展到表现出“$β$ -混合”依赖性的重尾VAR,但是速率是次优的,而额外的因子是难以处理的。本文改进了这些结果在两个重要的方向:(i)我们建立了最佳的一致性率和相应的有限样本界的基础模型参数,匹配的iid数据,模的时间依赖的价格,这是很容易解释,等于1的iid数据。(ii)我们将更一般的处罚估计(这是不可分解的,不像$\ell_1$规范),以诱导一般的稀疏模式。所采用的关键技术工具是一种新的,易于使用的浓度绑定重尾线性过程,不依赖于“混合”的概念,并给出更严格的界限。

英文摘要:

Recently, high dimensional vector auto-regressive models (VAR), have attracted a lot of interest, due to novel applications in the health, engineering and social sciences. The presence of temporal dependence poses additional challenges to the theory of penalized estimation techniques widely used in the analysis of their iid counterparts. However, recent work (e.g., [Basu and Michailidis, 2015, Kock and Callot, 2015]) has established optimal consistency of $\ell_1$-LASSO regularized estimates applied to models involving high dimensional stable, Gaussian processes. The only price paid for temporal dependence is an extra multiplicative factor that equals 1 for independent and identically distributed (iid) data. Further, [Wong et al., 2020] extended these results to heavy tailed VARs that exhibit "$β$-mixing" dependence, but the rates rates are sub-optimal, while the extra factor is intractable. This paper improves these results in two important directions: (i) We establish optimal consistency rates and corresponding finite sample bounds for the underlying model parameters that match those for iid data, modulo a price for temporal dependence, that is easy to interpret and equals 1 for iid data. (ii) We incorporate more general penalties in estimation (which are not decomposable unlike the $\ell_1$ norm) to induce general sparsity patterns. The key technical tool employed is a novel, easy-to-use concentration bound for heavy tailed linear processes, that do not rely on "mixing" notions and give tighter bounds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑