Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Sikora, Radosław | Skarbek, Władysław
Affiliations: Institute of Mathematics, Polish Academy of Sciences | Faculty of Electronics and Information Technology, Warsaw University of Technology Address: Nowowiejska 15/19, 00-665 Warszawa, POLAND. Email: [email protected]
Note: [] Address for correspondence: Institute of Mathematics, Polish Academy of Science, Warsaw, Sniadeckich 8
Note: [] Address for correspondence: Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
Abstract: It is shown that the discrete time dynamical system defined by the Oja-RLS algorithm is stable in the closed ring K(0,9/8) – $\overline{K}$(0,8/9) if only the initial gain β0 is bounded by (2B)−1, where B = b2 and b is the bound for the learning sequence. It is rigorously proved that automatically computed gains βn in Oja-RLS scheme converge to zero with the rate 1/n, almost surely.
Keywords: KLT transform, Principal Component Analysis, OJA-RLS learning scheme, stability of neural algorithm
DOI: 10.3233/FI-1998-34407
Journal: Fundamenta Informaticae, vol. 34, no. 4, pp. 441-453, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]