๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the twenty-seventh annual ACM symposium - Las Vegas, Nevada, United States (1995.05.29-1995.06.01)] Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 - Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros

โœ Scribed by Pan, Victor Y.

Book ID
127005859
Publisher
ACM Press
Year
1995
Tongue
English
Weight
939 KB
Category
Article
ISBN-13
9780897917186

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the twenty-seventh annual ACM
[ACM Press the twenty-seventh annual ACM symposium - Las Vegas, Nevada, United States (1995.05.29-1995.06.01)] Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 - Polynomial bounds for VC dimension of sigmoidal neural networks
โœ Karpinski, Marek; Macintyre, Angus ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› ACM Press ๐ŸŒ English โš– 647 KB

We introduce a new method for proving explicit upper bounds on the VC Dimension of general functional basis networks, and prove as an application, for the first time, the VC Dimension of analog neural networks with the sigmoid activation function o(y) = 1/1 + e-y to be bounded by a quadratic polynom