The DOI matches its Crossref record; 140 of the 140 references it cites were found in a registry or an index.
Machine learning advances for time series forecasting
Open accessAbstract
In this paper, we survey the most recent advances in supervised machine learning (ML) and high‐dimensional models for time‐series forecasting. We consider both linear and nonlinear alternatives. Among the linear methods, we pay special attention to penalized regressions and ensemble of models. The nonlinear methods considered in the paper include shallow and deep neural networks, in their feedforward and recurrent versions, and tree‐based methods, such as random forests and boosted trees. We also consider ensemble and hybrid models by combining ingredients from different alternatives. Tests for superior predictive ability are briefly reviewed. Finally, we discuss application of ML in economics and finance and provide an illustration with high‐frequency financial data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
(2014) · Cited by 33,419
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Research works printed but not linked: 33
- Adámek R., 2020, LASSO inference for high‐dimensional time series
- Babii A., 2020, Inference for high‐dimensional regressions with heteroskedasticity and autocorrelation
- Bartlett P., 2007, AdaBoost is consistent, Journal of Machine Learning Research, 8, 2347
- Borup D., 2020, Targeting predictors in random forest regression, Technical Report
- Borup D., 2020, Now‐ and backcasting initial claims with high‐dimensional daily internet search‐volume data, Technical Report, 3690832
- hlmann P. L., 2002, Research report/Seminar für Statistik, Eidgenössische Technische Hochschule (ETH)
- Callot L. A. F., 2013, Essays in nonlinear time series econometrics
- Foresee F. D., 1997, IEEE International Conference on Neural Networks, 1930
- 10.1016/S1574-0706(05)01002-5 · doi:10.1016/s1574-0706(05)01002-5
- Grenander U., 1981, Abstract inference
- Han Y., 2020, High‐dimensional linear regression for dependent data with applications to nowcasting, Statistica Sinica, 30, 1797
- Hecq A., 2019, Granger causality testing in high‐dimensional VARs: A post‐double‐selection procedure
- 10.1080/07350015.2014.985828 · doi:10.1080/07350015.2014.985828
- James W., 1961, Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 361
- 10.1016/j.ijforecast.2013.01.003 · doi:10.1016/j.ijforecast.2013.01.003
- 10.2139/ssrn.3536461 · doi:10.2139/ssrn.3536461
- 10.1111/j.1467-6419.2010.00640.x · doi:10.1111/j.1467-6419.2010.00640.x
- Medeiros M., 2013, Essays in nonlinear time series econometrics
- 10.1080/07474938.2017.1307319 · doi:10.1080/07474938.2017.1307319
- 10.1016/j.econlet.2015.11.017 · doi:10.1016/j.econlet.2015.11.017
- Melnyk I., 2016, International Conference on Machine Learning, 830
- Mhaska H., 2017, Proceedings of the Thirty‐First AAAI Conference on Artificial Intelligence (AAAI‐17), 2343
- 10.1007/s00180-012-0313-5 · doi:10.1007/s00180-012-0313-5
- 10.1016/j.spl.2010.07.013 · doi:10.1016/j.spl.2010.07.013
- 10.1080/02331888.2013.848865 · doi:10.1080/02331888.2013.848865
- 10.2307/1392186 · doi:10.2307/1392186
- Tikhonov A., 1963, On the solution of ill‐posed problems and the method of regularization, Doklady Akademii Nauk, 151, 501
- 10.1016/S0169-2070(00)00063-7 · doi:10.1016/s0169-2070(00)00063-7
- 10.1162/089976600300015006 · doi:10.1162/089976600300015006
- 10.1111/ectj.12117 · doi:10.1111/ectj.12117
- 10.1007/s10260-020-00506-w · doi:10.1007/s10260-020-00506-w
- 10.1080/00949655.2012.669383 · doi:10.1080/00949655.2012.669383
- 10.1214/18-EJS1402 · doi:10.1214/18-ejs1402
Cited by
Baz, M. (2024) · Mathematics · doi:10.3390/math12213320 · Cited by 1
Metadata
- Authors
- Masini, R. P., Medeiros, M. C., & Mendes, E. F.
- Venue
- Journal of Economic Surveys
- Publisher
- Wiley
- Published
- 2021-07
- Volume
- 37
- Issue
- 1
- Pages
- 76-111
- ISSN
- 0950-0804 (ISSN-L)
- 1467-6419
- OpenAlex
- W3114612967
- Cited by
- 515
- References
- 140
- FWCI
- 35.13
- Type
- journal article
- Language
- en
- Open access
- green
- Funders
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Machine learning advances for time series forecasting. https://app.cochat.ai/papers/10.1111/joes.12429
- The paper
- Masini, R. P., Medeiros, M. C., & Mendes, E. F. (2023). Machine learning advances for time series forecasting. Journal of Economic Surveys. https://doi.org/10.1111/joes.12429
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.