Cart (Loading....) | Create Account
Close category search window
 

Singularities in complete bipartite graph-type Boltzmann machines and upper bounds of stochastic complexities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yamazaki, K. ; Precision & Intelligence Lab., Tokyo Inst. of Technol., Yokohama, Japan ; Watanabe, S.

It is well known that Boltzmann machines are nonregular statistical models. The set of their parameters for a small size model is an analytic set with singularities in the space of a large size one. The mathematical foundation of their learning is not yet constructed because of these singularities, though they are applied to information engineering. Recently we established a method to calculate the Bayes generalization errors using an algebraic geometric method even if the models are nonregular. This paper clarifies that the upper bounds of generalization errors in Boltzmann machines are smaller than those in regular statistical models.

Published in:

Neural Networks, IEEE Transactions on  (Volume:16 ,  Issue: 2 )

Date of Publication:

March 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.