The Storage Capacity of a Fully-Connected Committee Machine
Abstract
We study the storage capacity of a fully-connected committee ma(cid:173) chine with a large number K of hidden nodes. The storage capac(cid:173) ity is obtained by analyzing the geometrical structure of the weight space related to the internal representation . By examining the as(cid:173) ymptotic behavior of order parameters in the limit of large K, the storage capacity Q c is found to be proportional to ]{ Jln ]{ 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.
Cite
Text
Xiong et al. "The Storage Capacity of a Fully-Connected Committee Machine." Neural Information Processing Systems, 1997.Markdown
[Xiong et al. "The Storage Capacity of a Fully-Connected Committee Machine." Neural Information Processing Systems, 1997.](https://mlanthology.org/neurips/1997/xiong1997neurips-storage/)BibTeX
@inproceedings{xiong1997neurips-storage,
title = {{The Storage Capacity of a Fully-Connected Committee Machine}},
author = {Xiong, Yuansheng and Kwon, Chulan and Oh, Jong-Hoon},
booktitle = {Neural Information Processing Systems},
year = {1997},
pages = {378-384},
url = {https://mlanthology.org/neurips/1997/xiong1997neurips-storage/}
}