Identifying a class of output error models using a multi-gradient algorithm with optimal stacking length

The output error model is widely used in industrial modeling. This work introduces an innovative gradient algorithm tailored for output error models. It is widely recognized that while traditional stochastic gradient algorithms offer low computational complexity, they are often criticized for their sluggish convergence rates. In response to this challenge, multi-gradient algorithms have been developed; however, current multi-gradient algorithms lack a straightforward approach for determining the appropriate stacking length. This paper presents a user-friendly variable stacking length multi-gradient algorithm grounded in the principle of cost function minimization. Simulation experiments demonstrate that the proposed method retains the benefits of traditional gradient algorithms while achieving rapid convergence with only a minor increase in computational complexity.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/ddcls66240.2025.11065514
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Identifying a class of output error models using a multi-gradient algorithm with optimal stacking length

Jinqiao Dai, Shaoxue Jing, Tong Zhou
Neural Networks and Applications
article

Identifying a class of output error models using a multi-gradient algorithm with optimal stacking length

Jinqiao Dai, Shaoxue Jing, Tong Zhou
article en

Abstract

The output error model is widely used in industrial modeling. This work introduces an innovative gradient algorithm tailored for output error models. It is widely recognized that while traditional stochastic gradient algorithms offer low computational complexity, they are often criticized for their sluggish convergence rates. In response to this challenge, multi-gradient algorithms have been developed; however, current multi-gradient algorithms lack a straightforward approach for determining the appropriate stacking length. This paper presents a user-friendly variable stacking length multi-gradient algorithm grounded in the principle of cost function minimization. Simulation experiments demonstrate that the proposed method retains the benefits of traditional gradient algorithms while achieving rapid convergence with only a minor increase in computational complexity.

Huaiyin Normal University (CN)
Openalex Percentile: Top 92%
Neural Networks and Applications
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.