抜粋
0(ws(s log d+log(dqh/s))) and 0(ws((h/s) log q)+log[dqh/s)) are upper bounds for the VC-dimension of a set of neural networks of units with piecewise polynomial activation functions, where s is the depth of the network, h is the number of hidden units, w is the number of adjustable parameters, q is the maximum of the number of polynomial segments of the activation function, and d is the maximum degree of the polynomials; also ω{ωslog(dqh/s)) is a lower bound for the VC-dimension of such a network set, which are tight for the cases s = Θ(h) and s is constant. For the special case q = 1, the VC-dimension is Θ(ws\ogd).
| 元の言語 | English |
|---|---|
| ホスト出版物のタイトル | Advances in Neural Information Processing Systems 11 - Proceedings of the 1998 Conference, NIPS 1998 |
| 出版者 | Neural information processing systems foundation |
| ページ | 323-329 |
| ページ数 | 7 |
| ISBN（印刷物） | 0262112450, 9780262112451 |
| 出版物ステータス | Published - 1999 1 1 |
| イベント | 12th Annual Conference on Neural Information Processing Systems, NIPS 1998 - Denver, CO, United States 継続期間: 1998 11 30 → 1998 12 5 |
出版物シリーズ
| 名前 | Advances in Neural Information Processing Systems |
|---|---|
| ISSN（印刷物） | 1049-5258 |
Other
| Other | 12th Annual Conference on Neural Information Processing Systems, NIPS 1998 |
|---|---|
| 国 | United States |
| 市 | Denver, CO |
| 期間 | 98/11/30 → 98/12/5 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
- Signal Processing
フィンガープリント Tight bounds for the VC-dimension of piecewise polynomial networks' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。
これを引用
Sakurai, A. (1999). Tight bounds for the VC-dimension of piecewise polynomial networks. ： Advances in Neural Information Processing Systems 11 - Proceedings of the 1998 Conference, NIPS 1998 (pp. 323-329). (Advances in Neural Information Processing Systems). Neural information processing systems foundation.