方法对比

	N-BEATS	ARIMA（自回归积分滑动平均）模型	随机森林
领域	深度学习	计量经济学	机器学习
方法族	Machine learning	Regression model	Machine learning
起源年份	2020	2015	2001
提出者	Oreshkin, B.N. et al.	Box & Jenkins (Box-Jenkins methodology)	Breiman, L.
类型	Deep neural forecasting architecture (interpretable basis expansion)	Univariate time-series model	Ensemble (bagging of decision trees)
开创性文献	Oreshkin, B.N. et al. (2020). N-BEATS: Neural Basis Expansion Analysis for Interpretable Time Series Forecasting. ICLR.	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	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	N-BEATS — Nöral Zaman Serisi Tahmini, Neural Basis Expansion Analysis, neural basis expansion	Box-Jenkins model, ARIMA(p,d,q), ARIMA Modeli	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	5	5	4
摘要	N-BEATS is a deep learning architecture for time series forecasting, introduced by Oreshkin and colleagues in 2020, built from interpretable trend and seasonality stacks. It was the first purely neural forecasting model to reach state-of-the-art performance on the M4 competition without relying on any classical statistical components.	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).	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.