Computer Science – Neural and Evolutionary Computing
Scientific paper
2008-04-30
Neural Information Processing - Letters and Reviews 8, 2 (2005) 25-29
Computer Science
Neural and Evolutionary Computing
Number of pages: 5. Typo page 26 line 3: one must read W=G^+F (instead of W=G^+W, which does not make sense!)
Scientific paper
Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors of synaptic weights, which contribute to the regularization of the input-output mapping. It is thus of interest to develop fast and accurate algorithms for computing Moore-Penrose inverse matrices. In this paper, an algorithm based on a full rank Cholesky factorization is proposed. The resulting pseudoinverse matrices are similar to those provided by other algorithms. However the computation time is substantially shorter, particularly for large systems.
No associations
LandOfFree
Fast Computation of Moore-Penrose Inverse Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fast Computation of Moore-Penrose Inverse Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Computation of Moore-Penrose Inverse Matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-577828