arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.00844stat.MLcs.LGstat.AP

多变量时间序列数据填补 via 分布鲁姆正则化

Multivariate Time Series Data Imputation via Distributionally Robust Regularization

Georgia Institute of Technology(佐治亚理工学院);University of Washington(华盛顿大学)

Che-Yi Liao, Zheng Dong, Gian-Gabriel Garcia, Kamran Paynabar

AI总结:

本文提出DRIO方法,通过分布鲁姆正则化在多变量时间序列填补中实现重建准确性和分布对齐的帕累托最优。

摘要:

多变量时间序列(MTS)填补常常受到观测数据分布与真实数据分布不匹配的影响——这种偏差被非平稳性和系统性缺失进一步加剧。标准方法通过最小化重建误差或鼓励分布对齐的风险会过度拟合这些有偏的数据。我们提出了分布鲁姆正则化填补目标(DRIO),它联合最小化重建误差和填补器与 Wasserstein 不确定性集内最坏情况分布之间的差异。我们推导出一个可处理的对偶公式,将无限维的度量优化减少为对抗性搜索样本轨迹,并提出一个与灵活深度学习骨干兼容的对抗学习算法。在多样化的现实世界数据集上的全面实验显示,DRIO 在完全随机缺失和非随机缺失设置下均能一致提高填补效果,达到重建准确性与分布对齐之间的帕累托最优权衡。

英文摘要:

Multivariate time series (MTS) imputation is often compromised by mismatch between observed and true data distributions -- a bias exacerbated by non-stationarity and systematic missingness. Standard methods that minimize reconstruction error or encourage distributional alignment risk overfitting these biased observations. We propose the Distributionally Robust Regularized Imputer Objective (DRIO), which jointly minimizes reconstruction error and the divergence between the imputer and a worst-case distribution within a Wasserstein ambiguity set. We derive a tractable dual formulation that reduces infinite-dimensional optimization over measures to adversarial search over sample trajectories, and propose an adversarial learning algorithm compatible with flexible deep learning backbones. Comprehensive experiments on diverse real-world datasets show DRIO consistently improves imputation under both missing-completely-at-random and missing-not-at-random settings, reaching Pareto-optimal trade-offs between reconstruction accuracy and distributional alignment.

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

↑