Порівняння методів

	N-HiTS	PatchTST	Випадковий ліс
Галузь	Глибоке навчання	Глибоке навчання	Машинне навчання
Родина	Machine learning	Machine learning	Machine learning
Рік появи	2023	2023	2001
Автор методу	Challu, C. et al.	Nie, Y. et al.	Breiman, L.
Тип	Deep neural forecasting (hierarchical interpolation)	Transformer for time series forecasting	Ensemble (bagging of decision trees)
Основоположне джерело	Challu, C. et al. (2023). NHITS: Neural Hierarchical Interpolation for Time Series Forecasting. AAAI.	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	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	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.	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.