TY - JOUR
T1 - FV-MgNet: Fully connected V-cycle MgNet for interpretable time series forecasting
AU - Zhu, Jianqing
AU - He, Juncai
AU - Zhang, Lian
AU - Xu, Jinchao
N1 - KAUST Repository Item: Exported on 2023-05-23
Acknowledgements: The first author is supported in part by Beijing Natural Science Foundation Project (No. Z200002), the second and fourth authors are partially supported by the KAUST Baseline Research Fund, and the third author is supported by Hetao Shenzhen-Hong Kong Science and Technology Innovation Cooperation Zone Project (No. HZOSWS-KCCYB-2022046).
PY - 2023/4/11
Y1 - 2023/4/11
N2 - By investigating iterative methods for a constrained linear model, we propose a new class of fully connected V-cycle MgNet for long-term time series forecasting, which is one of the most difficult tasks in forecasting. MgNet is a CNN model that was proposed for image classification based on the multigrid (MG) methods for solving discretized partial differential equations (PDEs). We replace the convolutional operations with fully connected operations in the existing MgNet and then apply them to forecasting problems. Motivated by the V-cycle structure in MG, we further propose the FV-MgNet, a V-cycle version of the fully connected MgNet, to extract features hierarchically. By evaluating the performance of FV-MgNet on popular datasets and comparing it with state-of-the-art models, we show that the FV-MgNet achieves better results with less memory usage and faster inference speed. In addition, we develop ablation experiments to demonstrate that the structure of FV-MgNet is the best choice among the many variants.
AB - By investigating iterative methods for a constrained linear model, we propose a new class of fully connected V-cycle MgNet for long-term time series forecasting, which is one of the most difficult tasks in forecasting. MgNet is a CNN model that was proposed for image classification based on the multigrid (MG) methods for solving discretized partial differential equations (PDEs). We replace the convolutional operations with fully connected operations in the existing MgNet and then apply them to forecasting problems. Motivated by the V-cycle structure in MG, we further propose the FV-MgNet, a V-cycle version of the fully connected MgNet, to extract features hierarchically. By evaluating the performance of FV-MgNet on popular datasets and comparing it with state-of-the-art models, we show that the FV-MgNet achieves better results with less memory usage and faster inference speed. In addition, we develop ablation experiments to demonstrate that the structure of FV-MgNet is the best choice among the many variants.
UR - http://hdl.handle.net/10754/687463
UR - https://linkinghub.elsevier.com/retrieve/pii/S1877750323000650
UR - http://www.scopus.com/inward/record.url?scp=85152106270&partnerID=8YFLogxK
U2 - 10.1016/j.jocs.2023.102005
DO - 10.1016/j.jocs.2023.102005
M3 - Article
SN - 1877-7503
VL - 69
SP - 102005
JO - Journal of Computational Science
JF - Journal of Computational Science
ER -