✦ LIBER ✦

Analysis of convergence performance of neural networks ranking algorithm

✍ Scribed by Yongquan Zhang; Feilong Cao

Book ID: 116774403
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 261 KB
Volume: 34
Category: Article
ISSN: 0893-6080
DOI: 10.1016/j.neunet.2012.06.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence properties of recursive rank

Convergence properties of recursive rank-order filter and neural network

✍ Akira Asano; Wei Zhang; Kazuyoshi Itoh; Yoshiki Ichioka 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Convergence analysis of convex increment

Convergence analysis of convex incremental neural networks

✍ Lei Chen; Hung Keng Pung 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 379 KB

A neural networks learning algorithm for

A neural networks learning algorithm for minor component analysis and its convergence analysis

✍ Dezhong Peng; Zhang Yi; JianCheng Lv; Yong Xiang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Convergence Analysis of Batch Gradient A

Convergence Analysis of Batch Gradient Algorithm for Three Classes of Sigma-Pi Neural Networks

✍ Chao Zhang; Wei Wu; Yan Xiong 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 294 KB

The convergence rate of a regularized ra

The convergence rate of a regularized ranking algorithm

✍ Chen, Hong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Stability of neural networks and converg

Stability of neural networks and convergence of their sensitivity computation algorithms

✍ Kiichi Urahama Member 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 500 KB

## Abstract This paper considers the continuous‐time model and the discrete‐time model for the neural network, and discusses the stability of the model and the convergence of the sensitivity computation algorithm. First, a sufficient condition is given for the global asymptotic stability of the mod