方法对比

	N-HiTS	ARIMA（自回归积分滑动平均）模型	PatchTST	随机森林
领域	深度学习	计量经济学	深度学习	机器学习
方法族	Machine learning	Regression model	Machine learning	Machine learning
起源年份	2023	2015	2023	2001
提出者	Challu, C. et al.	Box & Jenkins (Box-Jenkins methodology)	Nie, Y. et al.	Breiman, L.
类型	Deep neural forecasting (hierarchical interpolation)	Univariate time-series model	Transformer for time series forecasting	Ensemble (bagging of decision trees)
开创性文献	Challu, C. et al. (2023). NHITS: Neural Hierarchical Interpolation for Time Series Forecasting. AAAI.	Box, G. E. P., Jenkins, G. M., Reinsel, G. C. & Ljung, G. M. (2015). Time Series Analysis: Forecasting and Control (5th ed.). Wiley. ISBN: 978-1118675021	Nie, Y., Nguyen, N. H., Sinthong, P. & Kalagnanam, J. (2023). A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. ICLR.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	N-HiTS — Hiyerarşik İnterpolasyon Tahmini, NHITS, Neural Hierarchical Interpolation	Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli	PatchTST — Yama Tabanlı Zaman Serisi Transformer, patch-based time series transformer, channel-independent transformer	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	3	5	3	4
摘要	N-HiTS (Neural Hierarchical Interpolation for Time Series Forecasting), introduced by Challu and colleagues in 2023, is a deep neural forecasting architecture that combines the hierarchical forecasts of multiple stacks operating at different sampling rates and merges them through interpolation. It extends N-BEATS to deliver markedly better accuracy on long forecast horizons.	ARIMA is a univariate time-series forecasting model that combines autoregressive, integrated (differencing), and moving-average components to predict a single continuous series from its own past. It is the centrepiece of the Box-Jenkins methodology set out in Box, Jenkins, Reinsel & Ljung's Time Series Analysis (5th ed., 2015).	PatchTST is a patch-based Transformer architecture for time series forecasting, introduced by Nie and colleagues in 2023, that cuts each series into overlapping patches treated as tokens and processes channels independently. It balances computational efficiency with strong accuracy on long-horizon forecasting.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.