Abstract
We present a heuristical procedure for efficient estimation of the partition function in the Boltzmann distribution. The resulting speed-up is of immediate relevance for the speed-up of Boltzmann Machine learning rules, especially for networks with a sparse connectivity.
Cite
CITATION STYLE
APA
Nijman, M. J., & Kappen, H. J. (1996). Efficient learning in sparsely connected Boltzmann machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1112 LNCS, pp. 41–46). Springer Verlag. https://doi.org/10.1007/3-540-61510-5_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free