Analysis on the Convergence Time of Dual Neural Network-Based k rm WTA

• Published in: IEEE transaction on neural networks and learning systems 2012-04, Vol.23 (4), p.676-682
• Main Authors: Xiao, Yi, Liu, Yuxin, Leung, Chi-Sing, Sum, John Pui-Fai, Ho, Kevin
• Format: Article
• Language: English
• ISSN: 2162-237X; 2162-2388
• DOI: 10.1109/TNNLS.2012.2186315

A k -winner-take-all ( k rm WTA ) network is able to find out the k largest numbers from n inputs. Recently, a dual neural network (DNN) approach was proposed to implement the k rm WTA process. Compared to the conventional approach, the DNN approach has much less number of interconnections. A rough upper bound on the convergence time of the DNN- k rm WTA model, which is expressed in terms of input variables, was given. This brief derives the exact convergence time of the DNN- k rm WTA model. With our result, we can study the convergence time without spending excessive time to simulate the network dynamics. We also theoretically study the statistical properties of the convergence time when the inputs are uniformly distributed. Since a nonuniform distribution can be converted into a uniform one and the conversion preserves the ordering of the inputs, our theoretical result is also valid for nonuniformly distributed inputs.