时间卷积衍生多层储层计算

Johannes Viehweg, Dominik Walther, Prof. Dr. -Ing. Patrick Mäder
{"title":"时间卷积衍生多层储层计算","authors":"Johannes Viehweg, Dominik Walther, Prof. Dr. -Ing. Patrick Mäder","doi":"arxiv-2407.06771","DOIUrl":null,"url":null,"abstract":"The prediction of time series is a challenging task relevant in such diverse\napplications as analyzing financial data, forecasting flow dynamics or\nunderstanding biological processes. Especially chaotic time series that depend\non a long history pose an exceptionally difficult problem. While machine\nlearning has shown to be a promising approach for predicting such time series,\nit either demands long training time and much training data when using deep\nrecurrent neural networks. Alternative, when using a reservoir computing\napproach it comes with high uncertainty and typically a high number of random\ninitializations and extensive hyper-parameter tuning when using a reservoir\ncomputing approach. In this paper, we focus on the reservoir computing approach\nand propose a new mapping of input data into the reservoir's state space.\nFurthermore, we incorporate this method in two novel network architectures\nincreasing parallelizability, depth and predictive capabilities of the neural\nnetwork while reducing the dependence on randomness. For the evaluation, we\napproximate a set of time series from the Mackey-Glass equation, inhabiting\nnon-chaotic as well as chaotic behavior and compare our approaches in regard to\ntheir predictive capabilities to echo state networks and gated recurrent units.\nFor the chaotic time series, we observe an error reduction of up to $85.45\\%$\nand up to $87.90\\%$ in contrast to echo state networks and gated recurrent\nunits respectively. Furthermore, we also observe tremendous improvements for\nnon-chaotic time series of up to $99.99\\%$ in contrast to existing approaches.","PeriodicalId":501167,"journal":{"name":"arXiv - PHYS - Chaotic Dynamics","volume":"17 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Temporal Convolution Derived Multi-Layered Reservoir Computing\",\"authors\":\"Johannes Viehweg, Dominik Walther, Prof. Dr. -Ing. Patrick Mäder\",\"doi\":\"arxiv-2407.06771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The prediction of time series is a challenging task relevant in such diverse\\napplications as analyzing financial data, forecasting flow dynamics or\\nunderstanding biological processes. Especially chaotic time series that depend\\non a long history pose an exceptionally difficult problem. While machine\\nlearning has shown to be a promising approach for predicting such time series,\\nit either demands long training time and much training data when using deep\\nrecurrent neural networks. Alternative, when using a reservoir computing\\napproach it comes with high uncertainty and typically a high number of random\\ninitializations and extensive hyper-parameter tuning when using a reservoir\\ncomputing approach. In this paper, we focus on the reservoir computing approach\\nand propose a new mapping of input data into the reservoir's state space.\\nFurthermore, we incorporate this method in two novel network architectures\\nincreasing parallelizability, depth and predictive capabilities of the neural\\nnetwork while reducing the dependence on randomness. For the evaluation, we\\napproximate a set of time series from the Mackey-Glass equation, inhabiting\\nnon-chaotic as well as chaotic behavior and compare our approaches in regard to\\ntheir predictive capabilities to echo state networks and gated recurrent units.\\nFor the chaotic time series, we observe an error reduction of up to $85.45\\\\%$\\nand up to $87.90\\\\%$ in contrast to echo state networks and gated recurrent\\nunits respectively. Furthermore, we also observe tremendous improvements for\\nnon-chaotic time series of up to $99.99\\\\%$ in contrast to existing approaches.\",\"PeriodicalId\":501167,\"journal\":{\"name\":\"arXiv - PHYS - Chaotic Dynamics\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - PHYS - Chaotic Dynamics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.06771\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - PHYS - Chaotic Dynamics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.06771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

时间序列的预测是一项具有挑战性的任务,它涉及到金融数据分析、流量动态预测或生物过程理解等多种应用。尤其是依赖于漫长历史的混沌时间序列,更是一个异常棘手的问题。虽然机器学习已被证明是预测此类时间序列的一种有前途的方法,但在使用深度递归神经网络时,要么需要较长的训练时间和大量的训练数据。另一种方法是使用储层计算方法,这种方法具有很高的不确定性,使用储层计算方法时通常需要进行大量的随机初始化和广泛的超参数调整。在本文中,我们将重点放在储层计算方法上,并提出了一种将输入数据映射到储层状态空间的新方法。此外,我们还将这种方法融入到两种新型网络架构中,在降低对随机性依赖的同时,提高了神经网络的并行性、深度和预测能力。为了进行评估,我们从麦基-格拉斯方程中近似计算了一组时间序列,这些序列既有非混沌行为,也有混沌行为,并将我们的方法与回声状态网络和门控递归单元的预测能力进行了比较。对于混沌时间序列,我们观察到与回声状态网络和门控递归单元相比,误差分别降低了85.45%和87.90%。此外,与现有方法相比,我们还观察到非混沌时间序列的巨大改进,最高可达 99.99 美元。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Temporal Convolution Derived Multi-Layered Reservoir Computing
The prediction of time series is a challenging task relevant in such diverse applications as analyzing financial data, forecasting flow dynamics or understanding biological processes. Especially chaotic time series that depend on a long history pose an exceptionally difficult problem. While machine learning has shown to be a promising approach for predicting such time series, it either demands long training time and much training data when using deep recurrent neural networks. Alternative, when using a reservoir computing approach it comes with high uncertainty and typically a high number of random initializations and extensive hyper-parameter tuning when using a reservoir computing approach. In this paper, we focus on the reservoir computing approach and propose a new mapping of input data into the reservoir's state space. Furthermore, we incorporate this method in two novel network architectures increasing parallelizability, depth and predictive capabilities of the neural network while reducing the dependence on randomness. For the evaluation, we approximate a set of time series from the Mackey-Glass equation, inhabiting non-chaotic as well as chaotic behavior and compare our approaches in regard to their predictive capabilities to echo state networks and gated recurrent units. For the chaotic time series, we observe an error reduction of up to $85.45\%$ and up to $87.90\%$ in contrast to echo state networks and gated recurrent units respectively. Furthermore, we also observe tremendous improvements for non-chaotic time series of up to $99.99\%$ in contrast to existing approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Tunneling Time for Walking Droplets on an Oscillating Liquid Surface Rydberg excitons in cuprous oxide: A two-particle system with classical chaos Disruption of exo-asteroids around white dwarfs and the release of dust particles in debris rings in co-orbital motion Machine-aided guessing and gluing of unstable periodic orbits Nonequilibrium dynamics of coupled oscillators under the shear-velocity boundary condition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1