跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确研究时间序列回归、长期方差估计及序列相关下的检验推断。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Seunghwa Rho

利用平滑聚类标准误进行时间序列模型推断

研究问题
在具有序列相关的时间序列回归中,如何将时间聚类与非参数长期方差估计结合,并权衡检验过度拒绝和功效?
方法与思路
作者先将时间划分为不重叠聚类并组内聚合,再跨组核平滑或使用第二类离散余弦变换的级数方法估计长期方差。
材料陈述的贡献
摘要称,核方法的固定与增长聚类数极限不同,余弦方法则相同;模拟显示核平滑前聚类可减少过度拒绝,但可能损失功效。
阅读关注点
应核对聚类形成规则、固定聚类数的渐近框架、核与余弦方法的临界值,以及独立同分布 bootstrap 所处理的具体对象。
阅读边界
仅据所给出版社摘要,无法判断最佳聚类方式或具体功效变化;模拟中的 bootstrap 表现不能推广为任意序列相关下的有效性。

原文摘要

This paper proposes a long run variance estimator for conducting inference in time series regression models that combines the nonparametric approach with a cluster approach. The basic idea is to divide the time periods into non-overlapping clusters. The long run variance estimator is constructed by first aggregating within clusters and then kernel smoothing across clusters or applying the nonparametric series method to the clusters with Type II discrete cosine transform. We develop an asymptotic theory for test statistics based on these “smoothed-clustered” long run variance estimators. We derive asymptotic results holding the number of clusters fixed and also treating the number of clusters as increasing with the sample size. For the kernel smoothing approach, these two asymptotic limits are different whereas for the cosine series approach, the two limits are the same. When clustering before kernel smoothing, we find that the “fixed-number-of-clusters” asymptotic approximation works well whether the number of clusters is small or large. Finite sample simulations suggest that the naive i.i.d. bootstrap mimics the fixed-number-of-clusters critical values. The simulations also suggest that clustering before kernel smoothing can reduce over-rejections caused by strong serial correlation at a cost of power. When there is a natural way of clustering, clustering can reduce over-rejection problems and achieve small gains in power for the kernel approach. In contrast, the cosine series approach does not benefit from clustering.

笔记与分组