Prediction of Optical Chaos Using a Comparative Adaptive Extreme Learning Machine

In this letter, a comparative adaptive extreme learning machine (CAELM) is proposed for continuous prediction of optical chaos with a simple updating rule and low computational complexity. A recursive least square (RLS) with a adaptive forgetting factor (AFF) updating method is devised to track the dynamics of the optical chaos. The results demonstrate that the proposed CAELM can effectively execute the time-varying optical chaos predictions, and delivers much better performance in terms of normalized mean squared error (NMSE), with a value of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2.4\times 10 ^{-4}$ </tex-math></inline-formula>. It also demands fewer training samples than state-of-the-art adaptive methods. Finally, we validate CAELM’s generalization capability under the condition of changing laser parameters, and the proposed CAELM remains accurate and adaptive to predict the time-varying optical chaos with very short training length for the model update.

Authors

Institutions

Publication Details

Journal
IEEE Photonics Technology Letters
Published
2024-08-13
DOI
https://doi.org/10.1109/lpt.2024.3442813
Citations
1
Primary Topic
Neural Networks and Reservoir Computing
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prediction of Optical Chaos Using a Comparative Adaptive Extreme Learning Machine

Yuanlong Fan, Yangyundou Wang, Xiaopeng Shao, Chen Ma et al.
1 citations
IEEE Photonics Technology Letters
Neural Networks and Reservoir Computing
0.35
article

Prediction of Optical Chaos Using a Comparative Adaptive Extreme Learning Machine

Yuanlong Fan, Yangyundou Wang, Xiaopeng Shao, Chen Ma, Dawei Gao
article en
1 citations

Abstract

In this letter, a comparative adaptive extreme learning machine (CAELM) is proposed for continuous prediction of optical chaos with a simple updating rule and low computational complexity. A recursive least square (RLS) with a adaptive forgetting factor (AFF) updating method is devised to track the dynamics of the optical chaos. The results demonstrate that the proposed CAELM can effectively execute the time-varying optical chaos predictions, and delivers much better performance in terms of normalized mean squared error (NMSE), with a value of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2.4\times 10 ^{-4}$ </tex-math></inline-formula>. It also demands fewer training samples than state-of-the-art adaptive methods. Finally, we validate CAELM’s generalization capability under the condition of changing laser parameters, and the proposed CAELM remains accurate and adaptive to predict the time-varying optical chaos with very short training length for the model update.

IEEE Photonics Technology LettersVol. 36(18)
Xidian University (CN)
National Natural Science Foundation of China
Reduced inequalities
Openalex Percentile: Top 35%
Neural Networks and Reservoir Computing
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.