Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fitting ARMA Time Series Models without Identification: A Proximal Approach

Published 17 Feb 2020 in stat.CO and math.OC | (2002.06777v3)

Abstract: Fitting autoregressive moving average (ARMA) time series models requires model identification before parameter estimation. Model identification involves determining the order of the autoregressive and moving average components which is generally performed by inspection of the autocorrelation and partial autocorrelation functions or other offline methods. In this work, we regularize the parameter estimation optimization problem with a non-smooth hierarchical sparsity-inducing penalty based on two path graphs that allow performing model identification and parameter estimation simultaneously. A proximal block coordinate descent algorithm is then proposed to solve the underlying optimization problem efficiently. The resulting model satisfies the required stationarity and invertibility conditions for ARMA models. Numerical results supporting the proposed method are also presented.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Comparison of arima and artificial neural networks models for stock price prediction. Journal of Applied Mathematics, 2014, 2014.
  2. Structured sparsity through convex optimization. Statistical Science, 27(4):450–468, 2012.
  3. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences, 2(1):183–202, 2009.
  4. Messaoud Benidir and B Picinbono. Nonconvexity of the stability domain of digital filters. IEEE Transactions on Acoustics, Speech, and Signal Processing, 38(8):1459–1460, 1990.
  5. Sparse high-dimensional regression: Exact scalable algorithms and phase transitions. arXiv preprint arXiv:1709.10029, 2017.
  6. Best subset selection via a modern optimization lens. The Annals of Statistics, 44(2):813–852, 2016.
  7. A lasso for hierarchical interactions. Annals of statistics, 41(3):1111, 2013.
  8. Application of the arima models to urban roadway travel time prediction-a case study. In 2006 IEEE International Conference on Systems, Man and Cybernetics, volume 3, pages 2529–2534. IEEE, 2006.
  9. Explicit solutions for root optimization of a polynomial family with one affine constraint. IEEE transactions on automatic control, 57(12):3078–3089, 2012.
  10. Time series analysis: forecasting and control. John Wiley & Sons, 2015.
  11. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends® in Machine Learning, 3(1):1–122, 2011.
  12. Peeling potatoes near-optimally in near-linear time. SIAM Journal on Computing, 46(5):1574–1602, 2017.
  13. Workload prediction using arima model and its impact on cloud applications? qos. IEEE Transactions on Cloud Computing, 3(4):449–458, 2014.
  14. Subset arma selection via the adaptive lasso. Statistics and its Interface, 4(2):197–205, 2011.
  15. A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry, 1(2):155–182, 1986.
  16. Arima-based time series model of stochastic wind power generation. IEEE transactions on power systems, 25(2):667–676, 2009.
  17. Best stable and invertible approximations for arma systems. IEEE Transactions on signal processing, 40(12):3066–3069, 1992.
  18. Enrique Del Castillo. Statistical process adjustment for quality control, volume 369. Wiley-Interscience, 2002.
  19. Bilevel programming for hyperparameter optimization and meta-learning. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 1568–1577. PMLR, 10–15 Jul 2018.
  20. A convex optimization approach to arma modeling. IEEE transactions on automatic control, 53(5):1108–1119, 2008.
  21. Jacob E Goodman. On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato. Geometriae Dedicata, 11(1):99–106, 1981.
  22. James D Hamilton. Time series analysis, volume 2. Princeton New Jersey, 1994.
  23. Drought forecasting based on the remote sensing data using arima models. Mathematical and computer modelling, 51(11-12):1398–1403, 2010.
  24. Subset selection for vector autoregressive processes using lasso. Computational Statistics & Data Analysis, 52(7):3645–3657, 2008.
  25. Group lasso with overlap and graph lasso. In Proceedings of the 26th annual international conference on machine learning, pages 433–440. ACM, 2009.
  26. Structured variable selection with sparsity-inducing norms. Journal of Machine Learning Research, 12(Oct):2777–2824, 2011a.
  27. Proximal methods for hierarchical sparse coding. Journal of Machine Learning Research, 12(Jul):2297–2334, 2011b.
  28. Statistical and machine learning forecasting methods: Concerns and ways forward. PloS one, 13(3), 2018.
  29. Integer programming for learning directed acyclic graphs from continuous data. arXiv preprint arXiv:1904.10574, 2019.
  30. Thediscrete dantzig selector: Estimating sparse linear models via mixed integer linear optimization. IEEE Transactions on Information Theory, 63(5):3053–3075, 2017.
  31. Determining the closest stable polynomial to an unstable one. IEEE Transactions on signal processing, 39(4):901–906, 1991.
  32. Autoregressive process modeling via the lasso procedure. Journal of Multivariate Analysis, 102(3):528–549, 2011.
  33. Yu Nesterov. Gradient methods for minimizing composite functions. Mathematical Programming, 140(1):125–161, 2013.
  34. High dimensional forecasting via interpretable vector autoregression. arXiv preprint arXiv:1412.5250, 2014.
  35. Proximal algorithms. Foundations and Trends® in Optimization, 1(3):127–239, 2014.
  36. A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM Journal on Optimization, 23(2):1126–1153, 2013.
  37. Subset selection for vector autoregressive processes via adaptive lasso. Statistics & probability letters, 80(23-24):1705–1712, 2010.
  38. Regression coefficient and autoregressive order shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 69(1):63–78, 2007.
  39. Improving forecasting accuracy of annual runoff time series using arima based on eemd decomposition. Water Resources Management, 29(8):2655–2675, 2015.
  40. Sparse identification and estimation of large-scale vector autoregressive moving averages. arXiv preprint arXiv:1707.09208, 2017.
  41. Hierarchical sparse modeling: A choice of two group lasso formulations. Statistical Science, 32(4):531–560, 2017.
  42. A first-order optimization algorithm for statistical learning with hierarchical sparsity structure. INFORMS Journal on Computing, 34(2):1126–1140, 2022.
  43. Applications and comparisons of four time series models in epidemiological surveillance data. PLoS One, 9(2), 2014.
  44. The composite absolute penalties family for grouped and hierarchical variable selection. The Annals of Statistics, pages 3468–3497, 2009.
Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free