Copyright © 2006 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Papers -- Biocybernetics, Neurocomputing |
Naive Mean Field Approximation for Sourlas Error Correcting Code
1 The author is with Nara Women's University, Nara-shi, 630–8506 Japan. E-mail: takata{at}ics.nara-wu.ac.jp, 2 The author is with Yamaguchi University, Ube-shi, 755–8611 Japan. E-mail: shouno{at}yamaguchi-u.ac.jp, 3 The author is with The University of Tokyo, Kashiwa-shi, 277–8561 Japan. E-mail: okada{at}k.u-tokyo.ac.jp
Solving the error correcting code is an important goal with regard to communication theory. To reveal the error correcting code characteristics, several researchers have applied a statistical-mechanical approach to this problem. In our research, we have treated the error correcting code as a Bayes inference framework. Carrying out the inference in practice, we have applied the NMF (naive mean field) approximation to the MPM (maximizer of the posterior marginals) inference, which is a kind of Bayes inference. In the field of artificial neural networks, this approximation is used to reduce computational cost through the substitution of stochastic binary units with the deterministic continuous value units. However, few reports have quantitatively described the performance of this approximation. Therefore, we have analyzed the approximation performance from a theoretical viewpoint, and have compared our results with the computer simulation.
Key Words: naive mean field approximation, MPM inference, error correcting code, analog neural network
Manuscript received September 27, 2005. Manuscript revised January 23, 2006.