Neural Ordinary Differential Equation With Grünwald–Letnikov Fractional Momentum

IF 1.6 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Complexity Pub Date : 2026-10-14 DOI:10.1155/cplx/9182285
Wei Yang
{"title":"Neural Ordinary Differential Equation With Grünwald–Letnikov Fractional Momentum","authors":"Wei Yang","doi":"10.1155/cplx/9182285","DOIUrl":null,"url":null,"abstract":"<p>Forecasting short annual time series is challenging because limited observations increase the risks of unstable optimization, overfitting, and information leakage. This study proposes a standard first-order neural ordinary differential equation trained with finite-memory Grünwald–Letnikov fractional momentum. The fractional operator acts on the parameter update sequence rather than on the latent-state dynamics. The empirical evaluation combines a descriptive comparison on medium-length regional annual energy-consumption series with a 12-year holdout and a reproducible experiment on five extremely short provincial annual series, with the final two observations reserved for strictly recursive testing. The fractional order is selected by particle swarm optimization using only the training data. GLFNODE is compared with a NODE of the same architecture trained using Adam, together with MLP, ARIMA, SARIMA, ETS, and LSTM baselines. Across the five reported series, GLFNODE achieves test MAPE values ranging from 1.848% to 6.300%. Compared with the Adam-trained NODE, GLFNODE reduces the mean MAPE, MAE, and RMSE by 17.56%, 17.14%, and 15.91%, respectively. These results provide reproducible evidence that fractional-memory optimization can improve a compact neural ODE under extremely short-record conditions, particularly relative to the same architecture trained with Adam.</p>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2026 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2026-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/9182285","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/cplx/9182285","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Forecasting short annual time series is challenging because limited observations increase the risks of unstable optimization, overfitting, and information leakage. This study proposes a standard first-order neural ordinary differential equation trained with finite-memory Grünwald–Letnikov fractional momentum. The fractional operator acts on the parameter update sequence rather than on the latent-state dynamics. The empirical evaluation combines a descriptive comparison on medium-length regional annual energy-consumption series with a 12-year holdout and a reproducible experiment on five extremely short provincial annual series, with the final two observations reserved for strictly recursive testing. The fractional order is selected by particle swarm optimization using only the training data. GLFNODE is compared with a NODE of the same architecture trained using Adam, together with MLP, ARIMA, SARIMA, ETS, and LSTM baselines. Across the five reported series, GLFNODE achieves test MAPE values ranging from 1.848% to 6.300%. Compared with the Adam-trained NODE, GLFNODE reduces the mean MAPE, MAE, and RMSE by 17.56%, 17.14%, and 15.91%, respectively. These results provide reproducible evidence that fractional-memory optimization can improve a compact neural ODE under extremely short-record conditions, particularly relative to the same architecture trained with Adam.

具有gr nwald - letnikov分数动量的神经常微分方程
预测短的年度时间序列具有挑战性,因为有限的观测值增加了不稳定优化、过拟合和信息泄漏的风险。本文提出了一个标准的一阶神经常微分方程,该方程具有有限记忆的gr nwald - letnikov分数动量。分数运算符作用于参数更新序列,而不是作用于潜在状态动态。实证评价结合了对具有12年保留期的中等长度区域年能耗序列的描述性比较和对5个极短的省级年能耗序列的可重复实验,最后两个观测结果保留严格递归检验。通过粒子群算法,只使用训练数据选择分数阶。GLFNODE与使用Adam训练的相同架构的NODE进行比较,并结合MLP、ARIMA、SARIMA、ETS和LSTM基线。在五个报告的系列中,GLFNODE的测试MAPE值范围为1.848%至6.300%。与adam训练的NODE相比,GLFNODE的平均MAPE、MAE和RMSE分别降低了17.56%、17.14%和15.91%。这些结果提供了可重复的证据,证明分数内存优化可以在极短记录条件下改善紧凑的神经ODE,特别是相对于用Adam训练的相同架构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书