IP Library › Granted Patent US 12,561,407
Granted Patent B2
US 12,561,407 · App. 17/528,305 · Granted Feb 24, 2026

One-pass approach to automated timeseries forecasting

Inventors: Ritesh Ahuja (Los Angeles, CA); Anatoly Yakovlev (Hayward, CA); Venkatanathan Varadarajan (Seattle, WA); Sandeep R. Agrawal (San Jose, CA); Hesam Fathi Moghadam (Sunnyvale, CA); Sanjay Jinturkar (Santa Clara, CA); Nipun Agarwal (Saratoga, CA)
Assignee: Oracle International Corporation
G06F18/285G06F18/10G06F18/2148G06F18/2193G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,561,407
App. No.
17/528,305
Granted
Feb 24, 2026
Kind
B2
Abstract

Herein are timeseries preprocessing, model selection, and hyperparameter tuning techniques for forecasting development based on temporal statistics of a timeseries and a single feed-forward pass through a machine learning (ML) pipeline. In an embodiment, a computer hosts and operates the ML pipeline that automatically measures temporal statistic(s) of a timeseries. ML algorithm selection, cross validation, and hyperparameters tuning is based on the temporal statistics of the timeseries. The result from the ML pipeline is a rigorously trained and production ready ML model that is validated to have increased accuracy for multiple prediction horizons. Based on the temporal statistics, efficiency is achieved by asymmetry of investment of computer resources in the tuning and training of the most promising ML algorithm(s). Compared to other approaches, this ML pipeline produces a more accurate ML model for a given amount of computer resources and consumes fewer computer resources to achieve a given accuracy.

Claims (70)

1 . A method comprising:

automatically measuring, for a timeseries, a seasonality and a stationarity differencing count;

assigning the stationarity differencing count to a respective differencing hyperparameter of each machine learning (ML) algorithm from a plurality of ML algorithms;

selecting, based on said assigning, a most accurate ML algorithm from the plurality of ML algorithms;

identifying a values subrange of a seasonality hyperparameter of the most accurate ML algorithm;

automatically selecting, based on said stationarity differencing count, a minimum length of a training subsequence of the timeseries;

tuning, based on the values subrange of the seasonality hyperparameter of the most accurate ML algorithm, hyperparameters of said most accurate ML algorithm; and

training, with a plurality of subsequences of the timeseries that have at least the minimum length, an ML model that is based on; said tuning and the most accurate ML algorithm;

wherein the method is performed by one or more computers.

2 . The method of claim 1 wherein:

the plurality of ML algorithms consists of said most accurate ML algorithm and a plurality of other ML algorithms;

the method does not comprise tuning hyperparameters of at least one ML algorithm of the plurality of other ML algorithms.

3 . The method of claim 1 further comprising validating, based on said stationarity differencing count, said most accurate ML algorithm during at least one selected from the group consisting of:

said selecting said most accurate ML algorithm and

said tuning said hyperparameters of said most accurate ML algorithm.

4 . The method of claim 3 wherein:

said validating said most accurate ML algorithm comprises automatically calculating a forecast horizon duration.

5 . The method of claim 3 wherein:

said validating said most accurate ML algorithm comprises measuring, for each seasonality of a plurality of seasonalities, a respective fitness of said most accurate ML algorithm;

said fitnesses of said most accurate ML algorithm consists of:

a) a highest fitness for a particular seasonality of said plurality of seasonalities and

b) fitnesses for other seasonalities;

said tuning said hyperparameters of said most accurate ML algorithm is based on said particular seasonality and not said other seasonalities.

6 . The method of claim 1 further comprising validating the ML model based on said stationarity and at least one selected from the group consisting of seasonality and frequency.

7 . The method of claim 1 further comprising

measuring seasonality by at least one selected for the group consisting of:

fitting a second-degree polynomial regression,

fitting a polynomial regression with an ordinary least squares estimator,

applying an autocorrelation function (ACF) to a differenced timeseries that is based on said timeseries,

calculating a coefficient at specific lagged values of a differenced timeseries that is based on said timeseries,

calculating a coefficient that represent a strength of a linear relationship between respective values in two seasons of a same seasonality,

sorting respective coefficients of a plurality of seasonalities, and

identifying a subset of a plurality of seasonalities having respective coefficients that exceed a seasonality threshold.

8 . The method of claim 1 further comprising

measuring, based on said timeseries, a joint distribution of two selected from the group consisting of: a first expected value, a second expected value, a first variance, a second variance, a first moment of at least third order, and a second moment of at least third order.

9 . The method of claim 1 further comprising

calculating, based on a unit root test, a count of differencing operations needed for data stationarity.

10 . One or more computer-readable non-transitory media storing instructions that, when executed by one or more processors, cause:

automatically measuring, for a timeseries, a seasonality and a stationarity differencing count;

assigning the stationarity differencing count to a respective differencing hyperparameter of each machine learning (ML) algorithm from a plurality of ML algorithms;

selecting, based on said assigning, a most accurate ML algorithm from the plurality of ML algorithms;

identifying a values subrange of a seasonality hyperparameter of the most accurate ML algorithm;

automatically selecting, based on said stationarity differencing count, a minimum length of a training subsequence of the timeseries;

tuning, based on the values subrange of the seasonality hyperparameter of the most accurate ML algorithm, hyperparameters of said most accurate ML algorithm; and

training, with a plurality of subsequences of the timeseries that have at least the minimum length, an ML model that is based on; said tuning and the most accurate ML algorithm.

11 . The one or more computer-readable non-transitory media of claim 10 wherein:

the plurality of ML algorithms consists of said most accurate ML algorithm and a plurality of other ML algorithms;

the instructions does not cause tuning hyperparameters of at least one ML algorithm of the plurality of other ML algorithms.

12 . The one or more computer-readable non-transitory media of claim 10 wherein the instructions further cause validating, based on said stationarity differencing count, said most accurate ML algorithm during at least one selected from the group consisting of:

said selecting said most accurate ML algorithm and

said tuning said hyperparameters of said most accurate ML algorithm.

13 . The one or more computer-readable non-transitory media of claim 12 wherein;

said validating said most accurate ML algorithm comprises automatically calculating a forecast horizon duration.

14 . The one or more computer-readable non-transitory media of claim 12 wherein:

said validating said most accurate ML algorithm comprises measuring, for each seasonality of a plurality of seasonalities, a respective fitness of said most accurate ML algorithm;

said fitnesses of said most accurate ML algorithm consists of:

a) a highest fitness for a particular seasonality of said plurality of seasonalities and

b) fitnesses for other seasonalities;

said tuning said hyperparameters of said most accurate ML algorithm is based on said particular seasonality and not said other seasonalities.

15 . The one or more computer-readable non-transitory media of claim 10 wherein the instructions further cause validating the ML model based on said stationarity and at least one selected from the group consisting of seasonality and frequency.

16 . The one or more computer-readable non-transitory media of claim 10 wherein the instructions further cause

measuring seasonality by at least one selected for the group consisting of:

removing linear trends,

fitting a second-degree polynomial regression,

fitting a polynomial regression with an ordinary least squares estimator,

applying an autocorrelation function (ACF) to a differenced timeseries that is based on said timeseries,

calculating a coefficient at specific lagged values of a differenced timeseries that is based on said timeseries,

calculating a coefficient that represent a strength of a linear relationship between respective values in two seasons of a same seasonality,

sorting respective coefficients of a plurality of seasonalities, and

identifying a subset of a plurality of seasonalities having respective coefficients that exceed a seasonality threshold.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 17, 2021
From: AHUJA, RITESH; YAKOVLEV, ANATOLY; VARADARAJAN, VENKATANATHAN; AGRAWAL, SANDEEP R.; MOGHADAM, HESAM FATHI; JINTURKAR, SANJAY; AGARWAL, NIPUN
To: ORACLE INTERNATIONAL CORPORATION
Reel/Frame 058136/0227 →
Continuity (1)
Related Publication 20230153394A1 · May 18, 2023
References Cited (64)
US 11281969B1 · Rangapuram · 2022 [cited by examiner]
US 11443237B1 · Song · 2022 [cited by examiner]
US 11561946B1 · Jiang · 2023 [cited by examiner]
US 20020169735A1 · Kil et al. · 2002 [cited by applicant]
US 20140379904A1 · Shimasaki · 2014 [cited by applicant]
US 20180022539A1 · Vedani · 2018 [cited by applicant]
US 20180046926A1 · Achin · 2018 [cited by applicant]
US 20180225391A1 · Sali et al. · 2018 [cited by applicant]
US 20180246941A1 · Salunke et al. · 2018 [cited by applicant]
US 20190392255A1 · Franklin · 2019 [cited by applicant]
US 20200082013A1 · Triplet et al. · 2020 [cited by applicant]
US 20200183946A1 · Pelloin · 2020 [cited by applicant]
US 20200184382A1 · Fishkov · 2020 [cited by examiner]
US 20210089927A9 · Ryan · 2021 [cited by applicant]
US 20210216907A1 · Husain · 2021 [cited by examiner]
US 20210342691A1 · Lui · 2021 [cited by examiner]
US 20210390466A1 · Varadarajan et al. · 2021 [cited by applicant]
US 20220121955A1 · Chavoshi et al. · 2022 [cited by applicant]
Bermadez-Chacan et al. Automatic problem-specific hyperparameter optimization and model selection for supervised machine learning: Technical Report [retrieved on Jun. 16, 2025]. Retrieved from the Internet:<URL: https:/… [cited by examiner]
Suradhaniwar, S., Kar, S., Durbha, S. S., & Jagarlapudi, A. (2021). Time Series Forecasting of Univariate Agrometeorological Data: A Comparative Performance Evaluation via One-Step and Multi-Step Ahead Forecasting Strat… [cited by examiner]
Fawaz et al. “Deep learning for time series classification: a review”, Data Mining and Knowledge Discovery pp. 917-963 (2019). [cited by applicant]
Busseti et al., “Deep learning for time series modeling”, Technical Report, Stanford University pp. 1-5 (2012). [cited by applicant]
Bingham er al., “Pyro: Deep Universal Probabilistic Programming”, Journal of Machine Learning Research 20 (2019) 1-6, http://jmlr.org/papers/v20/18-403.html, dated Feb. 2019, 6 pages. [cited by applicant]
Jiang et al., “Markov Cross-Validation for Time Series Model Evaluations”, Elsevier, Information Sciences (2016), doi: 10.1016/j.ins.2016.09.061, dated 2017, 29 pages. [cited by applicant]
Hyndman, “Automatic Time Series Forecasting: The Forecast Package for R”, Journal of Statistical Software, vol. 27, Issue 3, http://www.jstatsoft.org/, dated Jul. 2008, 22 pages. [cited by applicant]
Gal et al., “Dropout as a Bayesian Approximation Representing Model Uncertainty in Deep Learning”, Proceedings of the 33rd International Conference on Machine Learning, JMLR: W&CP vol. 48, dated 2016, 10 pages. [cited by applicant]
Fildes et al., “An Evaluation of Simple Forecasting Model Selection Rules”, Lancaster University Management School, http://www.lums.lancs.ac.uk/publications, dated 2013, 32 pages. [cited by applicant]
Faloutsos et al., “Fast Subsequence Matching in Time Series Databases”, dated 1998, 11 pages. [cited by applicant]
De Livera, “Automatic Forecasting with a Modified Exponential Smoothing State space Framework”, Department of Econometrics and Business Statistics, http://www.buseco.monash.edu.au/depts/ebs/pubs/wpapers/, dated 2010, 30… [cited by applicant]
“Machine Learning Approaches for Time Series Data” dated May 19, 2019, 25 pages. [cited by applicant]
Brownlee, Jason, “Time Series Forecasting as Supervised Learning”, dated Aug. 21, 2019, 2 pages. [cited by applicant]
Lim et al., “Deep Probabilistic Modelling of Price Movements for High-Frequency Trading”, https://arxiv.org/pdf/2004.01498.pdf, dated 2020, 8 pages. [cited by applicant]
Bergmeir et al., “A Note on the Validity of Cross-Validation for Evaluating Time Series Prediction”, Department of Econometrics and Business Statistics, http://www.buseco.monash.edu.au/depts/ebs/pubs/wpapers/, dated 201… [cited by applicant]
Artificial Intelligence Blog, “Announcing Automated ML Capability in Azure Machine Learning”, dated Sep. 24, 2018, 8 pages. [cited by applicant]
Amazon SageMaker, “DeepAR Forecasting Algorithm”, https://docs.aws.amazon.com/sagemaker/latest/dg/deepar.html,last viewed on Jun. 29, 2020, 5 pages. [cited by applicant]
Alexandrov et al., “GluonTS: Probabilistic and Neural Time Series Modeling in Python”, Journal of Machine Learning Research 21 (2020) 1-6, http://jmlr.org/papers/v21/19-820.html, dated Apr. 20, 2020, 6 pages. [cited by applicant]
Ahmed et al., “An Empirical Comparison of Machine Learning Models for Time Series Forecasting”, dated Sep. 15, 2010, 31 pages. [cited by applicant]
Abe et al., “Developing an Integrated Time-Series Data Mining Environment for Medical Data Mining”, Seventh IEEE International Conference on Data Mining—Workshops, dated 2007, 6 pages. [cited by applicant]
Camerra et al., “Beyond One Billion Time Series: Indexing and Mining Very Large Time Series Collections with iSAX2+”, dated Feb. 16, 2013, 29 pages. [cited by applicant]
Oreshkin et al., “N-Beats: Neural Basis Expansion Analysis for Interpretable Time Series Forecasting”, published as a conference paper at ICLR 2020, arXiv:1905.10437v4 [cs.LG] Feb. 20, 2020, 31 pages. [cited by applicant]
Wang et al., “Experimental Comparison of Representation Methods and Distance Measures for Time Series Data”, dated Feb. 12, 2010, 35 pages. [cited by applicant]
Taylor et al., “Forecasting at Scale”, PeerJ Preprints, https://doi.org/10.7287/peerj.preprints.3190v2, dated Sep. 27, 2017, 25 pages. [cited by applicant]
Song et al., “Deep r-th Root of Rank Supervised Joint Binary Embedding for Multivariate Time Series Retrieval”, KDD 2018, dated Aug. 19-23, 2018, London, United Kingdom, 10 pages. [cited by applicant]
Shah et al., “AutoAI-TS: AutoAI for Time Series Forecasting”, Conference'17, Jul. 2017, Washington, DC, https://dl.acm.org/doi/abs/10.1145/3448016.3457557, dated Mar. 8, 2021, 13 pages. [cited by applicant]
Schoenfeld et al., “Preprocessor Selection for Machine Learning Pipelines”, dated 2018, 7 pages. [cited by applicant]
Salinas et al., “DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks”, Elsevier, https://doi.org/10.1016/j.ijforecast.2019.07.001, dated 2020, 11 pages. [cited by applicant]
Jung et al., “A Worrying Analysis of Probabilistic Time-Series Models for Sales Forecasting”, 1st I Can't Believe It's Not Better Workshop, http://proceedings.mlr.press/v137/jung20a/jung20a.pdf, dated 2020, 8 pages. [cited by applicant]
Paoli et al., “Forecasting of Preprocessed Daily Solar Radiation Time Series Using Neural Networks”, Solar Energy, Elsevier, dated 2010, 44 pages. [cited by applicant]
Kraska, Tim, “Northstar: An Interactive Data Science System”, Proceedings of the VLDB Endowment, vol. 11, No. 12 Copyright 2018 VLDB Endowment, 15 pages. [cited by applicant]
Oracle, “The Oracle AutoML Pipeline” Four Main Stages, https://docs.cloud.oracle.com/en-us/iaas/tools/ads-sdk/latest/user_guide/automl/overview.html, dated Apr. 28, 2020 or later, 4 pages. [cited by applicant]
Olson et al., “Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science”, dated Mar. 20, 2016, 8 pages. [cited by applicant]
Ng, “Data Preprocessing for Machine Learning: Options and Recommendations”, dated Jun. 22, 2020, 12 pages. [cited by applicant]
Ng et al., “Orbit: Probabilistic Forecast with Exponential Smoothing”, arXiv:2004.08492v4 [stat.CO], dated 2020, 6 pages. [cited by applicant]
Loning et al., “SKTIME: A Unified Interface for Machine Learning with Time Series”, https://github.com/alan-turing-institute/sktime, dated 2019, 9 pages. [cited by applicant]
Lin et al., “Experiencing SAX: A Novel Symbolic Representation of Time Series”, dated Apr. 3, 2007, 38 pages. [cited by applicant]
Yakovlev et al., “Oracle AutoML: A Fast and Predictive AutoML Pipeline”, Proceedings of the VLDB Endowment, vol. 13, No. 12, DOI: https://doi.org/10.14778/3415478.3415542, dated 2020, 15 pages. [cited by applicant]
Ploetz et al., “Feature Learning for Activity Recognition in Ubiquitous Computing”, dated Jan. 2011, 7 pages. [cited by applicant]
Kotthoff et al., “Auto-WEKA: Automatic Model Selection and Hyperparmeter Optimization in WEKA”, Ch. 4, Automated Machine Learning Methods, Sys, Challenges, https://doi.org/10.1007/978-3-030-05318-5_4, pp. 81-95, May 18,… [cited by applicant]
Komer et al., “Hyperopt-Sklearn”, Automated Machine Learning Methods, Systems, Challenges, https://doi.org/10.1007/978-3-030-05318-5_5, pp. 97-111, May 18, 2019, 15pgs. [cited by applicant]
Cuesta, Aitor Palacios, “Hyperparameter Optimization for Large-scale Machine Learning”, Master Thesis, Tech Univ of Berlin, DOI: 10.13140/RG.2.2.33876.65927, Oct. 2018, 85pgs. [cited by applicant]
Maher et al., “SmartML: A Meta Learning-Based Framework for Automated Selection and Hyperparameter Tuning for Machine Learning Algorithms”, Proceedings of the 22nd International Conference on Extending Database Technolo… [cited by applicant]
Berrar, D., “Cross-Validation” Research Gate at: https://www.researchgate.net/publication/324701535 (Jan. 2018) 9 pages. [cited by applicant]
Wei et al., “Learning and Using the Arrow of Time”, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, https://openaccess.thecvf.com/content_cvpr_2018/papers/Wei_Learning_and_Using_CVPR_2018_… [cited by applicant]
Misra et al., “Shuffle and Learn: Unsupervised Learning using Temporal Order Verification”, European Conference on Computer Vision, https://arxiv.org/pdf/1603.08561.pdf, dated Jul. 2016, 21 pages. [cited by applicant]