Abstract

Deep neural network with recurrent structure was proposed in the recent years and has been applied to time series forecasting. Many optimization algorithms are developed under the assumption of invariant and stationary data distributions, which is invalid for the non-stationary data. A novel optimization algorithm for modeling non-stationary time series is proposed in this paper. A moving window and exponential decay weights are used in this algorithm to eliminate the effects of the history gradients. The regret bound of the new algorithm is analyzed to ensure the convergency of the calculation. Simulations are done on short-term power load data sets, which are typically non-stationary. The results are superior to the existing optimization algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.