A Survey on Time-Series Pre-Trained Models

被引:8
作者
Ma, Qianli [1 ]
Liu, Zhen [1 ]
Zheng, Zhenjing [1 ]
Huang, Ziyang [1 ]
Zhu, Siying [1 ]
Yu, Zhongzhong [1 ]
Kwok, James T. [2 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong 999077, Peoples R China
基金
中国国家自然科学基金;
关键词
Time series analysis; Data models; Deep learning; Transformers; Forecasting; Surveys; Transfer learning; Convolutional neural networks; Computational modeling; Predictive models; Time-series mining; pre-trained models; deep learning; transfer learning; transformer; MULTIARMED BANDIT; NUCLEAR NORM;
D O I
10.1109/TKDE.2024.3475809
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Time-Series Mining (TSM) is an important research area since it shows great potential in practical applications. Deep learning models that rely on massive labeled data have been utilized for TSM successfully. However, constructing a large-scale well-labeled dataset is difficult due to data annotation costs. Recently, pre-trained models have gradually attracted attention in the time series domain due to their remarkable performance in computer vision and natural language processing. In this survey, we provide a comprehensive review of Time-Series Pre-Trained Models (TS-PTMs), aiming to guide the understanding, applying, and studying TS-PTMs. Specifically, we first briefly introduce the typical deep learning models employed in TSM. Then, we give an overview of TS-PTMs according to the pre-training techniques. The main categories we explore include supervised, unsupervised, and self-supervised TS-PTMs. Further, extensive experiments involving 27 methods, 434 datasets, and 679 transfer learning scenarios are conducted to analyze the advantages and disadvantages of transfer learning strategies, Transformer-based models, and representative TS-PTMs. Finally, we point out some potential directions of TS-PTMs for future work.
引用
收藏
页码:7536 / 7555
页数:20
相关论文
共 62 条
[1]  
Abbasi-Yadkori Y., ADV NEURAL INFORM PR, P2312
[2]   A Multiarmed Bandit Approach for House Ads Recommendations [J].
Aramayo, Nicolas ;
Schiappacasse, Mario ;
Goic, Marcel .
MARKETING SCIENCE, 2023, 42 (02) :271-292
[3]   Exploration-exploitation tradeoff using variance estimates in multi-armed bandits [J].
Audibert, Jean-Yves ;
Munos, Remi ;
Szepesvari, Csaba .
THEORETICAL COMPUTER SCIENCE, 2009, 410 (19) :1876-1902
[4]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[5]   Online Decision Making with High-Dimensional Covariates [J].
Bastani, Hamsa ;
Bayati, Mohsen .
OPERATIONS RESEARCH, 2020, 68 (01) :276-294
[6]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[7]  
Chu W., 2011, P 14 INT C ARTIFICIA, P208, DOI DOI 10.48550/ARXIV.1209.3352
[8]   Dynamic Allocation Optimization in A/B-Tests Using Classification-Based Preprocessing [J].
Claeys, Emmanuelle ;
Gancarski, Pierre ;
Maumy-Bertrand, Myriam ;
Wassner, Hubert .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (01) :335-349
[9]   Predicting Drug-Target Interactions Using Probabilistic Matrix Factorization [J].
Cobanoglu, Murat Can ;
Liu, Chang ;
Hu, Feizhuo ;
Oltvai, Zoltan N. ;
Bahar, Ivet .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2013, 53 (12) :3399-3409
[10]   Modeling Dynamic User Interests: A Neural Matrix Factorization Approach [J].
Dhillon, Paramveer S. ;
Aral, Sinan .
MARKETING SCIENCE, 2021, 40 (06) :1059-1080