| |
Abstract:
We study the storage capacity of a fully-connected committee
machine with a large number Kof hidden nodes. The storage capacity
is obtained by analyzing the geometrical structure of the weight
space related to the internal representation. By examining the
asymptotic behavior of the order parameters in the limit of large
K,
the storage capacity is found to be proportional to up to the
leading order. This result satisfies the mathematical bound given
by Mitchison and Durbin, whereas the replica-symmetric solution in
a conventional Gardner's approach violates this bound.
|
