Sammenlign metoder

	N-BEATS	DeepAR	Informer
Fagfelt	Dyp læring	Dyp læring	Dyp læring
Familie	Machine learning	Machine learning	Machine learning
Opprinnelsesår	2020	2020	2021
Opphavsperson	Oreshkin, B.N. et al.	Salinas, D., Flunkert, V. & Gasthaus, J. (Amazon)	Zhou, H. et al.
Type	Deep neural forecasting architecture (interpretable basis expansion)	Autoregressive recurrent neural network (probabilistic forecasting)	Transformer (ProbSparse self-attention)
Opprinnelig kilde	Oreshkin, B.N. et al. (2020). N-BEATS: Neural Basis Expansion Analysis for Interpretable Time Series Forecasting. ICLR.	Salinas, D., Flunkert, V., Gasthaus, J. & Januschowski, T. (2020). DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks. International Journal of Forecasting, 36(3), 1181–1191.	Zhou, H. et al. (2021). Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting. AAAI.
Alias	N-BEATS — Nöral Zaman Serisi Tahmini, Neural Basis Expansion Analysis, neural basis expansion	DeepAR — Olasılıksal RNN Tahmini, probabilistic autoregressive RNN forecasting, Amazon DeepAR	Informer — Uzun Dizi Transformer Tahmini, Informer transformer, ProbSparse attention forecaster
Relaterte	5	5	5
Sammendrag	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.	DeepAR is Amazon's industrial forecasting model, introduced by Salinas, Flunkert and Gasthaus (2017; published 2020), that uses an autoregressive recurrent neural network to estimate the parameters of a probability distribution at each step, producing a confidence interval rather than a single point forecast. It can model many related time series jointly within one model.	Informer is a Transformer-based model introduced by Zhou et al. in 2021 for long-sequence time-series forecasting, using a ProbSparse self-attention mechanism that lowers the computational complexity of the standard Transformer to O(L log L). It is built for problems that demand predictions across thousands of future steps.