A Reality Check for Data Snooping
数据窥探的现实检验AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要以时间序列数据的重复使用为背景,并直接检验模型相对基准的预测优势,对应预测方法与时间序列研究。
数据窥探的现实检验AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Data snooping occurs when a given set of data is used more than once for purposes of inference or model selection. When such data reuse occurs, there is always the possibility that any satisfactory results obtained may simply be due to chance rather than to any merit inherent in the method yielding the results. This problem is practically unavoidable in the analysis of time-series data, as typically only a single history measuring a given phenomenon of interest is available for analysis. It is widely acknowledged by empirical researchers that data snooping is a dangerous practice to be avoided, but in fact it is endemic. The main problem has been a lack of sufficiently simple practical methods capable of assessing the potential dangers of data snooping in a given situation. Our purpose here is to provide such methods by specifying a straightforward procedure for testing the null hypothesis that the best model encountered in a specification search has no predictive superiority over a given benchmark model. This permits data snooping to be undertaken with some degree of confidence that one will not mistake results that could have been generated by chance for genuinely good results.
循环重心编码器:预测、模拟及其在时间序列分析中的应用
This dissertation has two parts. In the first part we theoretically develop a framework that extends the optimal transport barycenter problem from independent data with observed covariates to processes whose relevant covariate is their own history. Given a stationary stochastic process, our framework shows there exists an invertible transport map that extracts from it an iid component whose distribution is the barycenter of the conditional distributions of the input process…
协整回归变量:折叠凹惩罚何时超越 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…
基于深度可分离神经网络的混频时间序列预测
To better forecast mixed-frequency time series, it is the key to choose a suitable way for frequency alignment. However, the existing methods are all limited to linear transformations, and this may overlook the possible nonlinearity, leading to a worse prediction. We alternatively consider a deep neural network for each frequency alignment, and hence a depth-separable neural network. Moreover, a parameter-sharing mechanism is adopted across the alignment at each stage,…
跨空间时间序列的预测驱动推断
The following motif is common in spatiotemporal settings: we have a sequence of covariate and label pairs observed for a relatively short, recent time period. We have access to unlabeled covariates over a longer time period. Data is observed over many spatial locations. For instance, crop yield might be observed over a large geographical area for recent years, but weather data (which is informative about crop yield) is available for a much longer period. The goal is to…
部分观测时间序列的潜变量驱动插补与预测:LIFTS
Partially observed multivariate time series pose two coupled challenges: recovering missing measurements and forecasting future trajectories when observation patterns are informative. Existing methods often assume ignorable missingness or use the mask only as an auxiliary input. We propose LIFTS (Latent-driven Imputation and Forecasting for partly observed Time Series), a probabilistic framework in which a latent process jointly governs the complete measurement trajectory…
利用路径签名回归进行即时预测
We introduce a new method of nowcasting using regression on path signatures. Path signatures capture the geometric properties of sequential data. Because signatures embed observations in continuous time, they naturally handle mixed frequencies and missing data. We prove theoretically, and demonstrate with simulations, that regression on signatures both subsumes the linear Kalman filter and has desirable consistency properties. Nowcasting with signatures is more robust to…