arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.14993cs.LGstat.ML
收藏

使用时间序列标记信息进行可证明有效的预测模型学习

Using Time-Series Privileged Information for Provably Efficient Learning of Prediction Models

Delft University of Technology(代尔夫特理工大学);Research Institute of Sweden(瑞典研究院);Massachusetts Institute of Technology(麻省理工学院);University of Toronto(多伦多大学);Chalmers University of Technology(查尔姆斯理工大学)

Rickard K. A. Karlsson, Martin Willbo, Zeshan Hussain, Rahul G. Krishnan, David Sontag, Fredrik D. Johansson

摘要:

我们研究了在学习过程中使用特权信息的监督模型对未来结果的预测。特权信息包括在预测的基线时间和未来结果之间观察到的时间序列的样本;该信息仅在训练时间可用,这与传统的监督学习不同。我们的问题是,使用这种特权数据何时会导致在测试时仅使用基线数据进行预测的模型的样本效率更高。我们给出了一个算法,这种设置和证明,当时间序列是从一个非平稳的高斯线性动力系统的固定水平线,学习特权信息是更有效的学习比没有it.on合成数据,我们测试我们的算法和理论的限制,无论是当我们的假设成立,当他们被违反。在三个不同的现实世界的数据集上,我们表明,我们的方法通常优于经典学习,特别是当数据稀缺时。最后,我们与我们的估计蒸馏方法理论和经验。

英文摘要:

We study prediction of future outcomes with supervised models that use privileged information during learning. The privileged information comprises samples of time series observed between the baseline time of prediction and the future outcome; this information is only available at training time which differs from the traditional supervised learning. Our question is when using this privileged data leads to more sample-efficient learning of models that use only baseline data for predictions at test time. We give an algorithm for this setting and prove that when the time series are drawn from a non-stationary Gaussian-linear dynamical system of fixed horizon, learning with privileged information is more efficient than learning without it. On synthetic data, we test the limits of our algorithm and theory, both when our assumptions hold and when they are violated. On three diverse real-world datasets, we show that our approach is generally preferable to classical learning, particularly when data is scarce. Finally, we relate our estimator to a distillation approach both theoretically and empirically.

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

↑